Results 1 
9 of
9
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 767 (11 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.
A formal theory of plan recognition and its implementation
 Reasoning about Plans
, 1991
"... inverse problem of plan recognition has focused on specific kinds of recognition in specific domains. This includes work on story understanding [Bruce 1981, Schank 1975, Wilensky ..."
Abstract

Cited by 126 (5 self)
 Add to MetaCart
inverse problem of plan recognition has focused on specific kinds of recognition in specific domains. This includes work on story understanding [Bruce 1981, Schank 1975, Wilensky
On the Declarative and Procedural Semantics of Logic Programs
 Journal of Automated Reasoning
, 1995
"... One of the most important and difficult problems in logic programming is the problem of finding a suitable declarative or intended semantics for logic programs. The importance of this problem stems from the declarative character of logic programming, whereas its difficulty can be largely attributed ..."
Abstract

Cited by 63 (8 self)
 Add to MetaCart
One of the most important and difficult problems in logic programming is the problem of finding a suitable declarative or intended semantics for logic programs. The importance of this problem stems from the declarative character of logic programming, whereas its difficulty can be largely attributed to the nonmonotonic character of the negation operator used in logic programs. The problem can therefore be viewed as the problem of finding a suitable formalization of the type of nonmonotonic reasoning used in logic programming. In this paper we introduce a semantics of logic programs based on the class PERF(P) of all, not necessarily Herbrand, perfect models of a program P and we show that the proposed semantics is not only natural but it also combines many of the desirable features of previous approaches, at the same time eliminating some of their drawbacks. For a positive program P, the class PERF(P) of perfect models coincides with the class MIN(P) of all minimal models of P. The per...
Multivalued Logics: A Uniform Approach to Inference in Artificial Intelligence
 Computational Intelligence
, 1988
"... This paper describes a uniform formalization of much of the current work in AI on inference systems. We show that many of these systems, including firstorder theorem provers, assumptionbased truth maintenance systems (atms's) and unimplemented formal systems such as default logic or circumscriptio ..."
Abstract

Cited by 56 (0 self)
 Add to MetaCart
This paper describes a uniform formalization of much of the current work in AI on inference systems. We show that many of these systems, including firstorder theorem provers, assumptionbased truth maintenance systems (atms's) and unimplemented formal systems such as default logic or circumscription can be subsumed under a single general framework. We begin by defining this framework, which is based on a mathematical structure known as a bilattice. We present a formal definition of inference using this structure, and show that this definition generalizes work involving atms's and some simple nonmonotonic logics. Following the theoretical description, we describe a constructive approach to inference in this setting; the resulting generalization of both conventional inference and atms's is achieved without incurring any substantial computational overhead. We show that our approach can also be used to implement a default reasoner, and discuss a combination of default and atms methods th...
On the relation between autoepistemic logic and circumscription
 In Proceedings IJCAI89
, 1989
"... Circumscription on the one hand and autoepistemic and default logics on the other seem to have quite different characteristics as formal systems, which makes it difficult to compare them as formalizations of defeasible connmonsense reasoning. In this paper we accomplish two tasks: (1) we extend the ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
Circumscription on the one hand and autoepistemic and default logics on the other seem to have quite different characteristics as formal systems, which makes it difficult to compare them as formalizations of defeasible connmonsense reasoning. In this paper we accomplish two tasks: (1) we extend the original semantics of autoepistemic logic to a language which includes variables quantified into the context of the autoepistemic operator, and (2) we show that a certain class of autoepistemic theories in the extended language has a minimalmodel semantics corresponding to circumscription. We conclude that all of the firstorder consequences of parallel predicate circumscription can be obtained from this class of autoepistemic theories. The correspondence we construct also sheds light on the problematic treatment of equality in circumscription. 1
On the Relationship Between CWA, Minimal Model and Minimal Herbrand Model Semantics
 International Journal of Intelligent Systems
, 1995
"... The purpose of this paper is to compare three types of nonmonotonic semantics: (a) prooftheoretic semantics based on the closed world assumption, (b) modeltheoretic semantics based on the notion of a minimal model and (c) modeltheoretic semantics based on the notion of a minimal Herbrand model. ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
The purpose of this paper is to compare three types of nonmonotonic semantics: (a) prooftheoretic semantics based on the closed world assumption, (b) modeltheoretic semantics based on the notion of a minimal model and (c) modeltheoretic semantics based on the notion of a minimal Herbrand model. All of these semantics capture the nonmonotonicity of common sense reasoning, i.e. the ability to withdraw conclusions after some new information is added to the original theories, and proved to be powerful enough to handle most examples of such reasoning presented in the literature. However, since these formalizations are based on different intuitions and often produce different results, the problem of understanding the relationship between them is especially important. In the first part of the paper we concentrate on the class of positive logic programs, also called definite theories. Although the three semantics usually differ for universal sentences, our main result shows that they alwa...
Mantra: A Shell For Hybrid Knowledge Representation
 IN IEEECONFERENCE ON TOOLS FOR AI, PP 164 171. IEEE, IEEE COMPUTER
, 1991
"... In this paper, we present a shell for hybrid knowledge representation. This system supports three different knowledge representation formalisms: Firstorder logic, terminological language and semantic networks. The firstorder logic formalism allows the representation of assertional knowledge in ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
In this paper, we present a shell for hybrid knowledge representation. This system supports three different knowledge representation formalisms: Firstorder logic, terminological language and semantic networks. The firstorder logic formalism allows the representation of assertional knowledge in the form of logic formulae, and the calculation of an entailment relation that, although weaker than the usual logic implication, has the advantage of being decidable. The terminological language allows the definition of concepts and nvalued relations between these concepts through the use of description primitives. These primitives include disjunction and negation, besides special symbols for the universal and empty entities. This formalism also supports the calculation of subsumption between entity descriptions. Finally,
Nonmonotonic Reasoning vs. Logic Programming: A New Perspective
 The Foundations of Artificial Intelligence. A Sourcebook
, 1987
"... this paper is to present an account of these recent developments. The paper is organized as follows. In Sections 2, 3 and 4 we briefly discuss declarative knowledge, nonmonotonic reasoning and logic programming, respectively. In Section 5 we describe the proposed semantics of logic programming and ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
this paper is to present an account of these recent developments. The paper is organized as follows. In Sections 2, 3 and 4 we briefly discuss declarative knowledge, nonmonotonic reasoning and logic programming, respectively. In Section 5 we describe the proposed semantics of logic programming and in Section 6 we show its equivalence to the four above mentioned formalizations of nonmonotonic reasoning. Section 7 contains concluding remarks. 2 Declarative Knowledge
Paraconsistent Inference and Preservation
 University of Technology, Sydney
, 1998
"... The study of paraconsistent inference is the study of inference which prohibits reasoning from inconsistent premises to arbitrary conclusions. In this paper we examine a family of syntax based paraconsistent inference relations and introduce a novel way to study and compare these relations in terms ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
The study of paraconsistent inference is the study of inference which prohibits reasoning from inconsistent premises to arbitrary conclusions. In this paper we examine a family of syntax based paraconsistent inference relations and introduce a novel way to study and compare these relations in terms of their preservational properties. 1