Results 1  10
of
20
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and nperson games
 Artificial Intelligence
, 1995
"... The purpose of this paper is to study the fundamental mechanism humans use in argumentation and its role in different major approaches to commonsense reasoning in AI and logic programming. We present three novel results: We develop a theory for argumentation in which the acceptability of arguments i ..."
Abstract

Cited by 775 (12 self)
 Add to MetaCart
The purpose of this paper is to study the fundamental mechanism humans use in argumentation and its role in different major approaches to commonsense reasoning in AI and logic programming. We present three novel results: We develop a theory for argumentation in which the acceptability of arguments is precisely defined. We show that logic programming and nonmonotonic reasoning in AI are different forms of argumentation. We show that argumentation can be viewed as a special form of logic programming with negation as failure. This result introduces a general method for generating metainterpreters for argumentation systems. 1.
Representing Action and Change by Logic Programs
 Journal of Logic Programming
, 1993
"... We represent properties of actions in a logic programming language that uses both classical negation and negation as failure. The method is applicable to temporal projection problems with incomplete information, as well as to reasoning about the past. It is proved to be sound relative to a semantics ..."
Abstract

Cited by 389 (28 self)
 Add to MetaCart
We represent properties of actions in a logic programming language that uses both classical negation and negation as failure. The method is applicable to temporal projection problems with incomplete information, as well as to reasoning about the past. It is proved to be sound relative to a semantics of action based on states and transition functions. 1 Introduction This paper extends the work of Eshghi and Kowalski [6], Evans [7] and Apt and Bezem [1] on representing properties of actions in logic programming languages with negation as failure. Our goal is to overcome some of the limitations of the earlier work. The existing formalizations of action in logic programming are adequate for only the simplest kind of temporal reasoning"temporal projection." In a temporal projection problem, we are given a description of the initial state of the world, and use properties of actions to determine what the world will look like after a series of actions is performed. Moreover, the existing ...
Logic Programming and Negation: A Survey
 JOURNAL OF LOGIC PROGRAMMING
, 1994
"... We survey here various approaches which were proposed to incorporate negation in logic programs. We concentrate on the prooftheoretic and modeltheoretic issues and the relationships between them. ..."
Abstract

Cited by 245 (8 self)
 Add to MetaCart
We survey here various approaches which were proposed to incorporate negation in logic programs. We concentrate on the prooftheoretic and modeltheoretic issues and the relationships between them.
Logic Programming and Knowledge Representation
 Journal of Logic Programming
, 1994
"... In this paper, we review recent work aimed at the application of declarative logic programming to knowledge representation in artificial intelligence. We consider exten sions of the language of definite logic programs by classical (strong) negation, disjunc tion, and some modal operators and sh ..."
Abstract

Cited by 224 (21 self)
 Add to MetaCart
In this paper, we review recent work aimed at the application of declarative logic programming to knowledge representation in artificial intelligence. We consider exten sions of the language of definite logic programs by classical (strong) negation, disjunc tion, and some modal operators and show how each of the added features extends the representational power of the language.
On Logic Program Semantics with Two Kinds of Negation
 Int. Joint Conf. and Symp. on LP
, 1992
"... Recently several authors have stressed and showed the importance of having a second kind of negation in logic programs for use in deductive databases, knowledge representation, and nonmonotonic reasoning [6, 7, 8, 9, 13, 14, 15, 24]. Different semantics for logic programs extended with :negation ( ..."
Abstract

Cited by 49 (16 self)
 Add to MetaCart
Recently several authors have stressed and showed the importance of having a second kind of negation in logic programs for use in deductive databases, knowledge representation, and nonmonotonic reasoning [6, 7, 8, 9, 13, 14, 15, 24]. Different semantics for logic programs extended with :negation (extended logic programs) have appeared [1, 4, 6, 9, 11, 12, 17, 19, 24] but, contrary to what happens with semantics for normal logic programs, there is no general comparison among them, specially in what concerns the use and meaning of the newly introduced :negation. The goal of this paper is to contrast a variety of these semantics in what concerns their use and meaning of :negation, and its relation to classical negation and to the default negation of normal programs, here denoted by not : To this purpose we define a parametrizeable schema to encompass and characterize a diversity of proposed semantics for extended logic programs, where the parameters are two: one the axioms AX: defin...
Knowledge Representation with Logic Programs
 DEPT. OF CS OF THE UNIVERSITY OF KOBLENZLANDAU
, 1996
"... In this tutorialoverview, which resulted from a lecture course given by the authors at ..."
Abstract

Cited by 31 (6 self)
 Add to MetaCart
In this tutorialoverview, which resulted from a lecture course given by the authors at
An Overview of Nonmonotonic Reasoning and Logic Programming
 Journal of Logic Programming, Special Issue
, 1993
"... The focus of this paper is nonmonotonic reasoning as it relates to logic programming. I discuss the prehistory of nonmonotonic reasoning starting from approximately 1958. I then review the research that has been accomplished in the areas of circumscription, default theory, modal theories and logic ..."
Abstract

Cited by 27 (2 self)
 Add to MetaCart
The focus of this paper is nonmonotonic reasoning as it relates to logic programming. I discuss the prehistory of nonmonotonic reasoning starting from approximately 1958. I then review the research that has been accomplished in the areas of circumscription, default theory, modal theories and logic programming. The overview includes the major results developed including complexity results that are known about the various theories. I then provide a summary which includes an assessment of the field and what must be done to further research in nonmonotonic reasoning and logic programming. 1 Introduction Classical logic has played a major role in computer science. It has been an important tool both for the development of architecture and of software. Logicians have contended that reasoning, as performed by humans, is also amenable to analysis using classical logic. However, workers in the field of artificial 1 This paper is an updated version of an invited Banquet Address, First Interna...
On The Correctness Of Unfold/fold Transformation Of Normal And Extended Logic Programs
 JOURNAL OF LOGIC PROGRAMMING
, 1995
"... ..."
Magic Sets and their Application to Data Integration
 In Proc. International Conference on Database Theory (ICDT 05), Springer LNCS 3363, 2005
, 2005
"... Abstract. We propose a generalization of the wellknown Magic Sets technique to Datalog ¬ programs with (possibly unstratified) negation under stable model semantics. Our technique produces a new program whose evaluation is generally more efficient (due to a smaller instantiation), while preserving ..."
Abstract

Cited by 25 (4 self)
 Add to MetaCart
Abstract. We propose a generalization of the wellknown Magic Sets technique to Datalog ¬ programs with (possibly unstratified) negation under stable model semantics. Our technique produces a new program whose evaluation is generally more efficient (due to a smaller instantiation), while preserving soundness under cautious reasoning. Importantly, if the original program is consistent, then full queryequivalence is guaranteed for both brave and cautious reasoning, which turn out to be sound and complete. In order to formally prove the correctness of our Magic Sets transformation, we introduce a novel notion of modularity for Datalog ¬ under the stable model semantics, which is relevant per se. We prove that a module can be evaluated independently from the rest of the program, while preserving soundness under cautious reasoning. For consistent programs, both soundness and completeness are guaranteed for brave reasoning and cautious reasoning as well. Our Magic Sets optimization constitutes an effective method for enhancing the performance of dataintegration systems in which queryanswering is carried out by means of cautious reasoning over Datalog ¬ programs. In fact, preliminary results of experiments in the EU project INFOMIX, show that Magic Sets are fundamental for the scalability of the system. 1
Abduction in Logic Programming: A New Definition and an Abductive Procedure Based on Rewriting
 Artificial Intelligence
, 2002
"... We propose a new definition of abduction in logic programming, and contrast it with that of Kakas and Mancarella's. We then introduce a rewriting system for answering queries and generating explanations, and show that it is both sound and complete under the partial stable model semantics and so ..."
Abstract

Cited by 20 (5 self)
 Add to MetaCart
We propose a new definition of abduction in logic programming, and contrast it with that of Kakas and Mancarella's. We then introduce a rewriting system for answering queries and generating explanations, and show that it is both sound and complete under the partial stable model semantics and sound and complete under the answer set semantics when the underlying program is socalled oddloop free. We discuss an application of the work to a problem in reasoning about actions and provide some experimental results. 1 Abduction in logic programming In general, given a background theory T , and an observation q to explain, an abduction of q w.r.t. T is a theory \Pi such that \Pi [ T j= q. Normally, we want to put some additional conditions on \Pi, such as that it is consistent with T and contains only those propositions called abducibles. For instance, in propositional logic, given a background theory T , a set A of assumptions or abducibles, and a proposition q, an explanation S...