We propose a novel method for efficient theta-subsumption. Our solution is based on the idea of object context which embody the contextual information in a clause and is given by occurrences of identical objects or ch...
详细信息
ISBN:
(纸本)9783540738466
We propose a novel method for efficient theta-subsumption. Our solution is based on the idea of object context which embody the contextual information in a clause and is given by occurrences of identical objects or chains of such occurrences. Efficient theta-subsumption is crucial for AI planning approaches that rely on lifted first-order reasoning. We incorporate our object context-based method for theta-subsumption within one approach for lifted first-order planning under uncertainty, referred to as LIFT-UP, and compare it with several related techniques.
Update of knowledge bases is becoming an important topic in artificialintelligence and a key problem in knowledge representation and reasoning. One of the latest ideas to update logic programs is choosing between mod...
详细信息
ISBN:
(纸本)9783540766308
Update of knowledge bases is becoming an important topic in artificialintelligence and a key problem in knowledge representation and reasoning. One of the latest ideas to update logic programs is choosing between models of Minimal Generalised Answer Sets to overcome disadvantages of previous approaches. this paper describes an implementation of the declarative version of updates sequences that has been proposed as an alternative to syntax-based semantics. One of the main contributions of this implementation is to use DLV's Weak Constraints to compute the model(s) of an update sequence, besides presenting the precise definitions proposed by the authors and an online solver. As a result;the paper makes an outline of the basic structure of the system, describes the employed technology, discusses the major process of computing the models;and illustrates the system through examples.
Two sets of rules are said to be strongly equivalent to each other if replacing one by the other within any logic program preserves the program's stable models. the familiar characterization of strong equivalence ...
详细信息
ISBN:
(纸本)9783540721994
Two sets of rules are said to be strongly equivalent to each other if replacing one by the other within any logic program preserves the program's stable models. the familiar characterization of strong equivalence of grounded programs in terms of the propositional logic of here-and-there is extended in this paper to a large class of logic programs with variables. this class includes, in particular, programs with conditional literals and cardinality constraints. the first-order version of the logic of here-and-there required for this purpose involves two additional non-intuitionistic axiom schemas.
CONDORCKD is a system implementing a novel approach to discovering knowledge from data. It addresses the issue of relevance of the learned rules by algebraic means and explicitly supports the subsequent processing by ...
详细信息
the proceedings contain 33 papers. the topics discussed include: logicprogramming and nonmonotic reasoning: from theory to systems and applications;policy based computing: from systems and applications to theory;the ...
详细信息
ISBN:
(纸本)9783540721994
the proceedings contain 33 papers. the topics discussed include: logicprogramming and nonmonotic reasoning: from theory to systems and applications;policy based computing: from systems and applications to theory;the first answer set programming system competition;CR-models: an inference engine for CR-prolog;debugging ASP programs by means of ASP;conflict-driven answer set enumeration;head-elementary-set-free logic programs;a deductive system for PC(ID);modularity aspects of disjunctive stable models;a unified semantics for constraint handling rules in transaction;conditional planning with external functions;general default logic;the LP-OD system logicprogramming meets outlier detection;a conflict-driven answer set solver;programming applications in CIFF;an application of defeasible logicprogramming to decision making in a robotic environment;on the effectiveness of looking ahead in search for answer sets;and modularity in SMODELS programs.
the concept of goal is central in artificialintelligence and its modelling is a challenging issue. It has been given much attention in areas such as Requirement Engineering (RE) and Planning and Scheduling, where its...
详细信息
ISBN:
(纸本)9783540742548
the concept of goal is central in artificialintelligence and its modelling is a challenging issue. It has been given much attention in areas such as Requirement Engineering (RE) and Planning and Scheduling, where its modelling can support formal reasoningthrough goal types, goal attributes and relations to other components. However there is a lack of formalisms able to reason with goal structures in dynamic environments. We claim that a logical framework based on Intuitionistic Type theory and more precisely, on Dependent Record Types is able to address this problem. the formal foundations rely on context modelling through dependent record types allowing partial knowledge and dynamic reasoning. For the purpose of goal modelling, we introduce a family of functions which map Context Record Types to Intentional Record Types expressing their related actions and goals. A case study in planning illustrates this approach.
SimStudent is a machine-learning agent that learns cognitive skills by demonstration. SimStudent was originally built as a building block for Cognitive Tutor Authoring Tools to help an author build a cognitive model w...
详细信息
ISBN:
(纸本)9781586037642
SimStudent is a machine-learning agent that learns cognitive skills by demonstration. SimStudent was originally built as a building block for Cognitive Tutor Authoring Tools to help an author build a cognitive model without significant programming. In this paper, we evaluate a second use of SimStudent, viz., student modeling for Intelligent Tutoring Systems. the basic idea is to have SimStudent observe human students solving problems. It then creates a cognitive model that can replicate the students' performance. If the model is accurate, it would predict the human students' performance on novel problems. An evaluation study showed that when trained on 15 problems, SimStudent accurately predicted the human students' correct behavior on the novel problems more than 80% of the time. However, the current implementation of SimStudent does not accurately predict when the human students make errors.
Contextual Graphs are a context-based formalism used in various real-world applications. they allow a uniform representation of elements of reasoning and of contexts for describing different human tasks such as troubl...
详细信息
ISBN:
(纸本)9783540742548
Contextual Graphs are a context-based formalism used in various real-world applications. they allow a uniform representation of elements of reasoning and of contexts for describing different human tasks such as troubleshooting and interpretation. A contextual graph represents a task realization. Its paths represent the different ways of reaching this realization, each way corresponding to a practice developed by an actor realizing the task. In this paper, we revisit the classical distinction between prescribed and effective tasks, procedures versus practices, logic of functioning versus logic of use, etc. in the light of this formalism. We discuss the position of the practice model with respect to the task model using an example involving troubleshooting a problem with a DVD player and another example involving the collaborative construction of an answer, and place this within the context of some other applications developed in the formalism of Contextual Graphs.
Separation logic is a recent extension of Hoare logic for reasoning about programs with references to shared mutable data structures. In this paper, we provide a new interpretation of the logic for a programming langu...
详细信息
暂无评论