Results 1  10
of
12
Nonmonotonic Reasoning by Monotonic Inferences with Priority Constraints
 In Nonmonotonic Extensions of Logic Programming
, 1997
"... . The purpose of this paper is to argue that nonmonotonic reasoning in general can be viewed as monotonic inferences constrained by a simple notion of priority constraint. More important, these type of constrained inferences can be specified in a knowledge representation language where a theory cons ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
(Show Context)
. The purpose of this paper is to argue that nonmonotonic reasoning in general can be viewed as monotonic inferences constrained by a simple notion of priority constraint. More important, these type of constrained inferences can be specified in a knowledge representation language where a theory consists of a collection of logic programminglike rules and a priority constraint among them: that the application of one rule blocks that of the lower ranked rules. We thus present a formal system for representing common sense knowledge, and call it priority logic. As applications, we recast default reasoning by priority reasoning, and show that Horty's defeasible inheritance networks can be represented by priority logic. This latter result is a partial answer to Horty's challenge that it is impossible to relate pathbased reasoning to general nonmonotonic formalisms. 1 Introduction In the past nonmonotonic reasoning has mainly been studied in formalisms where default assumptions constitute ...
An ArgumentBased Approach to Reasoning with Specificity
, 2001
"... We present a new prioritybased approach to reasoning with specificity which subsumes inheritance reasoning. The new approach differs from other prioritybased approaches in the literature in the way priority between defaults is handled. Here, it is conditional rather than unconditional as in other ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
We present a new prioritybased approach to reasoning with specificity which subsumes inheritance reasoning. The new approach differs from other prioritybased approaches in the literature in the way priority between defaults is handled. Here, it is conditional rather than unconditional as in other approaches. We show that
Nonmonotonic Reasoning as Prioritized Argumentation
 IEEE Transactions on Knowledge and Data Engineering
, 2001
"... This paper proposes a formalism for nonmonotonic reasoning based on prioritized argumentation. We argue that nonmonotonic reasoning in general can be viewed as selecting monotonic inferences by a simple notion of priority among inference rules. More importantly, these types of constrained inferen ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
(Show Context)
This paper proposes a formalism for nonmonotonic reasoning based on prioritized argumentation. We argue that nonmonotonic reasoning in general can be viewed as selecting monotonic inferences by a simple notion of priority among inference rules. More importantly, these types of constrained inferences can be specified in a knowledge representation language where a theory consists of a collection of rules of first order formulas and a priority among these rules. We recast default reasoning as a form of prioritized argumentation, and illustrate how the parameterized formulation of priority may be used to allow various extensions and modifications to default reasoning. We also show that it is possible, but more difficult, to express prioritized argumentation by default logic: even some particular forms of prioritized argumentation cannot be represented modularly by defaults under the same language. Keywords: Nonmonotonic reasoning, argumentation; priority, default logic, represen...
A Default Interpretation of Defeasible Network
 In Proc. IJCAI'97
, 1997
"... This paper studies the semantics for the class of all defeasible (inheritance) networks, including cyclic and inconsistent networks using a transformation approach. First we show that defeasible networks can be translated, tractably, to default theories while preserving Horty's offpath credul ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
This paper studies the semantics for the class of all defeasible (inheritance) networks, including cyclic and inconsistent networks using a transformation approach. First we show that defeasible networks can be translated, tractably, to default theories while preserving Horty's offpath credulous semantics for all consistent networks. Using the existing methods in dealing with the semantics of default logic, we are able to provide a tractable skeptical semantics, the wellfounded semantics, and a new credulous semantics, the regular semantics, both of which are defined for any defeasible network. Furthermore, we show that these semantics are based on the same principle of specificity used by Horty in defining his credulous semantics of defeasible networks. 1 Introduction Two fundamental problems are to be addressed in this paper. First, the semantics of defeasible networks has previously been studied mainly under the assumption that such a network is acyclic and consistent. There is...
Building a Knowledge Base: An Example
, 2000
"... this paper is to illustrate applications of some recent developments in the theory of logic programming to knowledge representation and reasoning in common sense domains. We are especially interested in better understanding the process of development of such representations together with their sp ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
this paper is to illustrate applications of some recent developments in the theory of logic programming to knowledge representation and reasoning in common sense domains. We are especially interested in better understanding the process of development of such representations together with their specifications
unknown title
"... A default interpretation of defeasible network This paper studies the semantics for the class of all defeasible (inheritance) networks, including cyclic and in consistent networks using a transformation approach. First we show that defeasible networks can be translated, tractably, to default theorie ..."
Abstract
 Add to MetaCart
A default interpretation of defeasible network This paper studies the semantics for the class of all defeasible (inheritance) networks, including cyclic and in consistent networks using a transformation approach. First we show that defeasible networks can be translated, tractably, to default theories while preserving Horty's pathoff credulous semantics for all consistent networks. Using the existing methods in dealing with the semantics of default logic, we are able to provide a tractable skeptical semantics, the wellfounded semantics ^ and a new credulous semantics, the regular semantics ^ both of which are defined for any defeasible network. Furthermore, we show that these semantics are based on the same principle of specificity used by Horty in defining his credulous semantics of defeasible networks. 1
Disjunctive Logic Programs with Inheritance Revisited
"... We argue for a semantical modification of the language DLP . We show by examples that the current DLP representation in some cases does not provide intuitive answers, in particular when applied to inheritance reasoning. ..."
Abstract
 Add to MetaCart
We argue for a semantical modification of the language DLP . We show by examples that the current DLP representation in some cases does not provide intuitive answers, in particular when applied to inheritance reasoning.
Compiling Defeasible Inheritance Networks to General Logic Programs
 Artificial Intelligence
, 1999
"... We present a method of compiling arbitrary defeasible (inheritance) networks to general logic programs. We show a onetoone correspondence between the credulous extensions of a defeasible network and the stable models of the translated logic program. This result leads to the discovery that an elega ..."
Abstract
 Add to MetaCart
We present a method of compiling arbitrary defeasible (inheritance) networks to general logic programs. We show a onetoone correspondence between the credulous extensions of a defeasible network and the stable models of the translated logic program. This result leads to the discovery that an elegant query answering procedure for Horty's credulous extensions had long existed: the abductive proof procedure formulated by Eshghi and Kowalski for general logic programs is sound and complete for acyclic defeasible networks under the proposed translation. Since the translation is faithful to the commonly accepted notion of specicity, it leads to a novel transformational approach: any semantics dened for general logic programs yields an extension semantics for networks, and any query answering procedure developed for general logic programs can be used to answer queries for networks under the same semantics. This approach also yields new insights into the diculties confronting pathbased fo...