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.
Over the years, nonmonotonic rules have proven to be a very expressive and useful knowledge representation paradigm. they have recently been used to complement the expressive power of Description logics (DLs), leading...
详细信息
Over the years, nonmonotonic rules have proven to be a very expressive and useful knowledge representation paradigm. they have recently been used to complement the expressive power of Description logics (DLs), leading to the study of integrative formal frameworks, generally referred to as hybrid knowledge bases, where both DL axioms and rules can be used to represent knowledge. the need to use these hybrid knowledge bases in dynamic domains has called for the development of update operators, which, given the substantially different way DLs and rules are usually updated, has turned out to be an extremely difficult task. In Slota and Leite (2010b Towards Closed World reasoning in Dynamic Open Worlds. theory and Practice of logicprogramming, 26th Int'l. conference on logicprogramming (ICLP'10) Special Issue 10(4-6) (July), 547-564.), a first step towards addressing this problem was taken, and an update operator for hybrid knowledge bases was proposed. Despite its significance-not only for being the first update operator for hybrid knowledge bases in the literature, but also because it has some applications-this operator was defined for a restricted class of problems where only the ABox was allowed to change, which considerably diminished its applicability. Many applications that use hybrid knowledge bases in dynamic scenarios require both DL axioms and rules to be updated. In this paper, motivated by real world applications, we introduce an update operator for a large class of hybrid knowledge bases where boththe DL component as well as the rule component are allowed to dynamically change. We introduce splitting sequences and splitting theorem for hybrid knowledge bases, use them to define a modular update semantics, investigate its basic properties, and illustrate its use on a realistic example about cargo imports.
We prove two properties of logic programs under the answer set semantics that may be useful in connection with applications of logicprogramming to representing causality and to planning. One theorem is about the use ...
详细信息
ISBN:
(纸本)3540667490
We prove two properties of logic programs under the answer set semantics that may be useful in connection with applications of logicprogramming to representing causality and to planning. One theorem is about the use of disjunctive rules to express that an atom is exogenous. the other provides an alternative way of expressing that a plan does not include concurrently executed actions.
We describe a new grounder system for logic programs under answer set semantics, called GrinGo. Our approach combines and extends techniques from the two primary grounding approaches of lparse and dlv. A major emphasi...
详细信息
ISBN:
(纸本)9783540721994
We describe a new grounder system for logic programs under answer set semantics, called GrinGo. Our approach combines and extends techniques from the two primary grounding approaches of lparse and dlv. A major emphasis lies on an extensible design that allows for an easy incorporation of new language features in an efficient system environment.
this paper investigates separated autoepistemic logic which is a generalization of Moore's autoepistemic logic with separate modalities for belief and disbelief. Along the separation of beliefs and disbeliefs, the...
详细信息
ISBN:
(纸本)3540632557
this paper investigates separated autoepistemic logic which is a generalization of Moore's autoepistemic logic with separate modalities for belief and disbelief. Along the separation of beliefs and disbeliefs, the relationship between autoepistemic logic and default logic becomes very intuitive. Straightforward ways of translating default theories into separated autoepistemic theories and back are presented. these translations are shown to preserve a variety of semantics of default theories such as those based on default extensions, weak extensions and stationary extensions. these classes of extensions are captured by their analogs in separated autoepistemic logic, and vice versa. A particular novelty of the approach is that a reasonable notion of separated stationary expansions can be established.
We show how to deploy the CIFF System 4.0 for abductive logicprogramming with constraints in a number of applications, ranging from combinatorial applications to web management. We also compare the CIFF System 4.0 wi...
详细信息
ISBN:
(纸本)9783540721994
We show how to deploy the CIFF System 4.0 for abductive logicprogramming with constraints in a number of applications, ranging from combinatorial applications to web management. We also compare the CIFF System 4.0 with a number of logicprogramming tools, namely the A-System, the DLV system and the SMODELS system.
this paper gives a brief high-level description of the implementation of a disjunctive logicprogramming system referred to as DisLoP. this system is a result of research activities of the Disjunctive logic Programmin...
详细信息
ISBN:
(纸本)3540632557
this paper gives a brief high-level description of the implementation of a disjunctive logicprogramming system referred to as DisLoP. this system is a result of research activities of the Disjunctive logicprogramming-project (funded by Deutsche Forschungs-Gemeinschaft), undertaken by the University of Koblenz since July 1995.
In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple reasoning over answer sets is sometimes supported...
详细信息
ISBN:
(纸本)9783642042379
In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple reasoning over answer sets is sometimes supported by ASP systems (usually in the form of computing brave or cautious consequences), but Slightly more involved reasoning problems require external postprocessing. Generally speaking, it is often desirable to use (a subset of) brave or cautious consequences of a program P-1 as input to another program P-2 in order to provide the desired Solutions to the problem to be solved. In practice, the evaluation of the program P-1 Currently has to be decopuled from the evaluation of P-2 using an intermediate step which collects the desired consequences of P-1 and provides them as input to P-2. In this work, we present a novel method for representing such a procedure within a single program, and thus within the realm of ASP itself. Our technique relies oil rewriting P-1 into a so-called manifold program. which allows for accessing all desired consequences of P-1 within a single answer set. then, this manifold program can be evaluated jointly with P-2 avoiding any intermediate computation step. For determining the consequences within the manifold program we use weak constraints, which is strongly motivated by complexity considerations. As an application, we present all encoding for computing the ideal extension of,in abstract argumentation framework.
the support for function symbols in logicprogramming under answer set semantics allows to overcome some modeling limitations of traditional Answer Set programming (ASP) systems, Such as the inability of handling infi...
详细信息
ISBN:
(纸本)9783642042379
the support for function symbols in logicprogramming under answer set semantics allows to overcome some modeling limitations of traditional Answer Set programming (ASP) systems, Such as the inability of handling infinite domains. On the other hand, admitting function symbols in ASP makes inference undecidable in the general case. Lately. the research community is focusing on finding proper subclasses for which decidability of inference is guaranteed. the two major proposals, so far, are finitary programs and finitely-ground programs. these two proposals are somehow complementary: indeed, the former is conceived to allow decidable querying (by means of a top-down evaluation strategy), while file latter supports the computability of answer-sets (by means of a bottom-up evaluation strategy). One of the main advantages of finitely-ground programs is that they can be "directly" evaluated by Current ASP systems, which are based on a bottom-up computational model. However, there are also some interesting programs which are suitable for top-down query evaluation;but do not fall in the class of finitely-ground programs. In this paper, we focus on disjunctive finitely-recursive Positive (DFRP) programs. We present a proper adaptation of the magic-sets technique for DFRP programs, which ensures query equivalence under both brave and cautious reasoning. We show that, if the input program is DFRP, then its magic-set rewriting is guaranteed to be finitely ground. thus, reasoning oil DFRP programs turns Out to be decidable, and we provide an effective method for its computation on the ASP system DLV.
We show how a class of domains written in the Language E, a high level language for reasoning about actions, narratives and. change, can be translated into the argumentation framework of logicprogramming without Nega...
详细信息
ISBN:
(纸本)3540667490
We show how a class of domains written in the Language E, a high level language for reasoning about actions, narratives and. change, can be translated into the argumentation framework of logicprogramming without Negation as Failure (LPwNF). this translation enables us 1) to understand default persistence as captured by various temporal reasoning frameworks in a simple and natural way, by assigning higher priority to information about effects of later actions over effects of earlier actions;2) to develop an argumentation-based computational model for this type of reasoning in logicprogramming goal-driven style.
暂无评论