Given two classes of logic programs, we may be interested in modular translations from one class into the other that are sound with respect to the answer set semantics. the main theorem of this paper characterizes the...
详细信息
ISBN:
(纸本)3540285385
Given two classes of logic programs, we may be interested in modular translations from one class into the other that are sound with respect to the answer set semantics. the main theorem of this paper characterizes the existence of such a translation in terms of strong equivalence. the theorem is used to study the expressiveness of several classes of programs, including the comparison of cardinality constraints with monotone cardinality atoms.
We describe the development of a constraint logicprogramming based system, called CPP, which is capable of generating most preferred plans with respect to a user's preference and evaluate its performance.
ISBN:
(纸本)9783540721994
We describe the development of a constraint logicprogramming based system, called CPP, which is capable of generating most preferred plans with respect to a user's preference and evaluate its performance.
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.
We define a nonmonotonic formalism that shares some features withthree other systems of nonmonotonicreasoning-default logic, logicprogramming with strong negation, and nonmonotonic causal logic-and study its possib...
详细信息
nlp is a compiler for nested logicprogramming under answer set semantics. It is designed as a front-end translating nested logic programs into disjunctive ones, whose answer sets are then computable by disjunctive lo...
详细信息
ISBN:
(纸本)354020721X
nlp is a compiler for nested logicprogramming under answer set semantics. It is designed as a front-end translating nested logic programs into disjunctive ones, whose answer sets are then computable by disjunctive logicprogramming systems, like dlv or gnt. nlp offers different translations: One is polynomial but necessitates the introduction of new atoms, another is exponential in the worst case but avoids extending the language. We report experimental results, comparing the translations on several classes of benchmark problems.
Strong equivalence is an important property for nonmonotonic formalisms, allowing safe local changes to a nonmonotonictheory. this paper considers strong equivalence for nonmonotonic causal theories of the kind intro...
详细信息
ISBN:
(纸本)354020721X
Strong equivalence is an important property for nonmonotonic formalisms, allowing safe local changes to a nonmonotonictheory. this paper considers strong equivalence for nonmonotonic causal theories of the kind introduced by McCain and Turner. Causal theories T-1 and T-2 are strongly equivalent if, for every causal theory T, T-1 boolean OR T and T-2 boolean OR T are equivalent (that is, have the same causal models). the paper introduces a convenient characterization of this property in terms of so-called SE-models, much as was done previously for answer set programs and default theories. A similar result is provided for the nonmonotonic modal logic UCL. the paper also introduces a reduction from the problem of deciding strong equivalence of two causal theories to the problem of deciding equivalence of two sets of propositional formulas.
the program composition approach can be fruitfully applied to combine general logic programs, i.e, logic programs possibly containing negative premises. We show how the introduction of a basic set of (meta-level) comp...
详细信息
ISBN:
(纸本)3540632557
the program composition approach can be fruitfully applied to combine general logic programs, i.e, logic programs possibly containing negative premises. We show how the introduction of a basic set of (meta-level) composition operations over general programs increases the knowledge representation capabilities of logicprogramming for non-monotonic reasoning. Examples of modular programming, hierarchical reasoning, constraints, and rules with exceptions will be illustrated. the semantics of programs and program compositions is defined in terms of three-valued logic [15]. the computational interpretation of program compositions is formalised by an equivalence preserving syntactic transformation of arbitrary program compositions into standard general programs.
the formalism of nonmonotonic causal theories (Ciunchiglia, Lee, Lifschitz, McCain, Turner, 2004) provides a general-purpose formalism for nonmonotonicreasoning and knowledge representation, as well as a higher level...
详细信息
ISBN:
(纸本)3540285385
the formalism of nonmonotonic causal theories (Ciunchiglia, Lee, Lifschitz, McCain, Turner, 2004) provides a general-purpose formalism for nonmonotonicreasoning and knowledge representation, as well as a higher level, special-purpose notation, the action language C+, for specifying and reasoning about the effects of actions and the persistence ('inertia') of facts over time. In this paper we investigate some logical properties of these formalisms. there are two motivations. From the technical point of view, we seek to gain additional insights into the properties of the languages when viewed as a species of conditional logic. From the practical point of view, we are seeking to find conditions under which two different causal theories, or two different action descriptions in C+, can be said to be equivalent, withthe further aim of helping to decide between alternative formulations when constructing practical applications.
In this paper, we address the problem of checking whether two disjunctive logic programs possess exactly the same stable models. An existing translation-based method [14], which was designed for weight constraint prog...
详细信息
ISBN:
(纸本)354020721X
In this paper, we address the problem of checking whether two disjunctive logic programs possess exactly the same stable models. An existing translation-based method [14], which was designed for weight constraint programs supported by the SMODELS system, is generalized to the disjunctive case. Moreover, we report on our preliminary experiments with an implementation of the method, a translator called DLPEQ.
this paper continues the line of research on representing actions, on the automation of commonsense reasoning and on planning that deals with causal theories and with action language C. We show here that many of the i...
详细信息
ISBN:
(纸本)3540667490
this paper continues the line of research on representing actions, on the automation of commonsense reasoning and on planning that deals with causal theories and with action language C. We show here that many of the ideas developed in that work can be formulated in terms of logic programs under the answer set semantics, without mentioning causal theories. the translations from C into logicprogrammingthat we investigate serve as a basis for the use of systems for computing answer sets to reason about action domains described in C and to generate plans in such domains.
暂无评论