Defeasible Description logics (DDLs) can state defeasible concept inclusions and often use rational closure according to the KLM postulates for reasoning. If in DDLs with quantification a defeasible sub-sumption relat...
详细信息
ISBN:
(纸本)9783319616605;9783319616599
Defeasible Description logics (DDLs) can state defeasible concept inclusions and often use rational closure according to the KLM postulates for reasoning. If in DDLs with quantification a defeasible sub-sumption relationship holds between concepts, it can also hold if these concepts appear nested in existential restrictions. Earlier reasoning algorithms did not detect this kind of relationships. We devise a new form of canonical models that extend classical ones for EL. by elements that satisfy increasing amounts of defeasible knowledge and show that reasoning w.r.t. these models yields the missing rational entailments.
Defeasible logic is extended to programming languages for cognitive agents with preferences and actions for planning. We define rule-based agent theories that contain preferences and actions, together with inference p...
详细信息
ISBN:
(纸本)354030553X
Defeasible logic is extended to programming languages for cognitive agents with preferences and actions for planning. We define rule-based agent theories that contain preferences and actions, together with inference procedures. We discuss patterns of agent types in this setting. Finally, we illustrate the language by an example of an agent reasoning about web-services.
In this paper we propose proof systems without labels for the intuitionistic modal logic IS5 that are based on a new multi-contextual sequent structure appropriate to deal with such a logic. We first give a label-free...
详细信息
ISBN:
(纸本)9783642175107
In this paper we propose proof systems without labels for the intuitionistic modal logic IS5 that are based on a new multi-contextual sequent structure appropriate to deal with such a logic. We first give a label-free natural deduction system and thus derive natural deduction systems for the classical modal logic S5 and also for an intermediate logic IM5. then we define a label-free sequent calculus for IS5 and prove its soundness and completeness. the study of this calculus leads to a decision procedure for IS5 and thus to an alternative syntactic proof of its decidability.
We give a logicprogramming based account of probability and describe a declarative language P-log capable of reasoning which combines bothlogical and probabilistic arguments. Several non-trivial examples illustrate ...
详细信息
ISBN:
(纸本)354020721X
We give a logicprogramming based account of probability and describe a declarative language P-log capable of reasoning which combines bothlogical and probabilistic arguments. Several non-trivial examples illustrate the use of P-log for knowledge representation.
Although epistemic logicprogramming has an enhanced capacity to handle complex incomplete information reasoning and represent agents' epistemic behaviours, it embeds a significantly higher computational complexit...
详细信息
Although epistemic logicprogramming has an enhanced capacity to handle complex incomplete information reasoning and represent agents' epistemic behaviours, it embeds a significantly higher computational complexity than non-disjunctive and disjunctive answer set programming. In this paper, we investigate some important properties of epistemic logic programs. In particular, we show that Lee and Lifschitz's result on loop formulas for disjunctive logic programs can be extended to a special class of epistemic logic programs. We also study the polysize model property for epistemic logic programs. Based on these discoveries, we identify two non-trivial classes of epistemic logic programs whose consistency checking complexity is reduced from PSPACE-complete to NP-complete and Sigma(P)(2)-complete respectively. We observe that many important applications on epistemic representation fall into these two classes of epistemic logic programs.
the logic FO(ID) extends classical first order logic with inductive definitions. this paper studies the satisifiability problem for PC(ID), its propositional fragment. We develop a framework for model generation in th...
详细信息
ISBN:
(纸本)354030553X
the logic FO(ID) extends classical first order logic with inductive definitions. this paper studies the satisifiability problem for PC(ID), its propositional fragment. We develop a framework for model generation in this logic, present an algorithm and prove its correctness. As FO(ID) is an integration of classical logic and logicprogramming, our algorithm integrates techniques from SAT and ASP. We report on a prototype system, called MIDL, experimentally validating our approach.
the paper presents some applications in planning and multi-agent systems of answer set programming. It highlights the benefits of answer set programming based techniques in these applications. It also describes a clas...
详细信息
ISBN:
(纸本)9783319616605;9783319616599
the paper presents some applications in planning and multi-agent systems of answer set programming. It highlights the benefits of answer set programming based techniques in these applications. It also describes a class of multi-agent planning problems that is challenging to answer set programming.
暂无评论