this paper presents two applications of the ASP-Prolog system, one of the earliest modular logicprogramming frameworks for integrating ASP and traditional Prolog/CLP reasoning. Both applications represent significant...
详细信息
A strong intuition for AGM belief change operations, Gardenfors suggests, is that formulas that are independent of a change should remain intact. Based on this intuition, Farias and Herzig axiomatize a dependence rela...
A strong intuition for AGM belief change operations, Gardenfors suggests, is that formulas that are independent of a change should remain intact. Based on this intuition, Farias and Herzig axiomatize a dependence relation w.r.t. a belief set, and formalize the connection between dependence and belief change. In this paper, we introduce base dependence as a relation between formulas w.r.t. a belief base. After an axiomatization of base dependence, we formalize the connection between base dependence and a particular belief base change operation, saturated kernel contraction. Moreover, we prove that base dependence is a reversible generalization of Farias and Herzig's dependence. that is, in the special case when the underlying belief base is deductively closed (i.e., it is a belief set), base dependence reduces to dependence. Finally, an intriguing feature of Farias and Herzig's formalism is that it meets other criteria for dependence, namely, Keynes' conjunction criterion for dependence (CCD) and Gardenfors' conjunction criterion for independence (CCI). We show that our base dependence formalism also meets these criteria. More interestingly, we offer a more specific criterion that implies both CCD and CCI, and show our base dependence formalism also meets this new criterion.
Stream reasoning is an emerging research field focused on dynamic processing and continuous reasoning over huge volumes of streaming data. Finding the right trade-off between scalability and expressivity is a key chal...
详细信息
Turner's logic of universal causation is a general logic for nonmonotonicreasoning. It has its origin in McCain and Turner's causal action theories which have been translated to propositional logic and logic ...
详细信息
ISBN:
(纸本)9783642405648
Turner's logic of universal causation is a general logic for nonmonotonicreasoning. It has its origin in McCain and Turner's causal action theories which have been translated to propositional logic and logicprogramming with nested expressions. In this paper, we propose to do the same for Turner's logic, and show thatTurner's logic can actually be mapped to McCain and Turner's causal theories. these results can be used to construct a system for reasoning in Turner's logic.
Within everyday reasoning we often use argumentation patterns that employ the rather vague notion of something being normally true. this form of reasoning is usually captured using Reiter's Default logic. However,...
详细信息
ISBN:
(纸本)9783642405648
Within everyday reasoning we often use argumentation patterns that employ the rather vague notion of something being normally true. this form of reasoning is usually captured using Reiter's Default logic. However, in Default logic one has to make explicit the rules which are to be used for reasoning and which are supposed to be normally true. this is a bit contrary to the everyday situation where people use experience to decide what normally follows from particular observations and what not, not using any kind of logical rules at all. To formalize this kind of reasoning we propose an approach which is based on prior experiences, using the fact that something follows normally if this is the case for "almost all" of the available experience.
the proceedings contain 26 papers. the topics discussed include: inconsistency management for description logic programs and beyond;reasoning about pattern-based XML queries;answer set programming: language, applicati...
ISBN:
(纸本)9783642396656
the proceedings contain 26 papers. the topics discussed include: inconsistency management for description logic programs and beyond;reasoning about pattern-based XML queries;answer set programming: language, applications and development tools;a variant of earley deduction with partial evaluation;verification and synthesis in description logic based dynamic systems;towards an efficient algorithm to reason over description logics extended with nominal schemas;computing incoherence explanations for learned ontologies;an ontology-based reasoning approach for electric power utilities;conjunctive queries with negation over DL-lite: a closer look;on the exploration of the query rewriting space with existential rules;incomplete information in RDF;RIO: minimizing user interaction in ontology debugging;and eliminating nonmonotonic DL-atoms in description logic programs.
Parametrized logic programs are very expressive logic programs that generalize normal logic programs under the stable model semantics, by allowing complex formulas of a parameter logic to appear in the body and head o...
详细信息
ISBN:
(纸本)9783642405648
Parametrized logic programs are very expressive logic programs that generalize normal logic programs under the stable model semantics, by allowing complex formulas of a parameter logic to appear in the body and head of rules. In this paper we study the decidability of these rich programs and propose an implementation that combines, in a modular way, a reasoner for the parameter logic with an answer set solver.
In recent work, we provided a formulation of ASP programs in terms of linear logictheories. Based on this work, in this paper we propose and discuss a modified Answer Set Semantics, "Resource-based Answer Set Se...
详细信息
ISBN:
(纸本)9783642405648
In recent work, we provided a formulation of ASP programs in terms of linear logictheories. Based on this work, in this paper we propose and discuss a modified Answer Set Semantics, "Resource-based Answer Set Semantics".
We extend the language of here-and-there logic by two kinds of atomic programs allowing to minimally update the truth value of a propositional variable here or there, if possible. these atomic programs are combined by...
详细信息
ISBN:
(纸本)9783642405648
We extend the language of here-and-there logic by two kinds of atomic programs allowing to minimally update the truth value of a propositional variable here or there, if possible. these atomic programs are combined by the usual dynamic logic program connectives. We investigate the mathematical properties of the resulting extension of equilibrium logic: we prove that the problem of logical consequence in equilibrium models is EXPTIME complete by relating equilibrium logic to dynamic logic of propositional assignments.
In this paper we present a technique based on logicprogramming for data cleaning, and its application to a real use case from the Italian Healthcare System. the use case is part of a more complex project developing a...
详细信息
ISBN:
(纸本)9783642405648
In this paper we present a technique based on logicprogramming for data cleaning, and its application to a real use case from the Italian Healthcare System. the use case is part of a more complex project developing a business intelligence suite for the analysis of distributed archives of tumor-based diseases.
暂无评论