Results 1 - 10 of 55

Mixing Strict and Defeasible Inheritance

by John F. Hortyt, Richmond I%. Thomason
"... Abstract: Commonsense or expert knowledge of any rich domain involves an intricate mixture of strict and defeasible information. The importance of representing defeasible information in an inheritance system has been widely recognized, but it is not enough for a system to represent only defeasible i ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract: Commonsense or expert knowledge of any rich domain involves an intricate mixture of strict and defeasible information. The importance of representing defeasible information in an inheritance system has been widely recognized, but it is not enough for a system to represent only defeasible

AN ANALYSIS OF DEFEASIBLE INHERITANCE SYSTEMS

by Karl Schlechta , 2007
"... We give a conceptual analysis of (defeasible or nonmonotonic) inheritance diagrams, and compare our analysis to the ”small/big sets ” of preferential and related reasoning. In our analysis, we consider nodes as information sources and truth values, direct links as information, and valid paths as inf ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
We give a conceptual analysis of (defeasible or nonmonotonic) inheritance diagrams, and compare our analysis to the ”small/big sets ” of preferential and related reasoning. In our analysis, we consider nodes as information sources and truth values, direct links as information, and valid paths

Defeasible inheritance systems and reactive diagrams ∗

by Dov M Gabbay, Karl Schlechta , 2008
"... Inheritance diagrams are directed acyclic graphs with two types of connections between nodes: x → y (read x is a y) and x ̸ → y (read as x is not a y). Given a diagram D, one can ask the formal question of “is there a valid (winning) path between node x and node y? ” Depending on the existence of a ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
approach the area on two fronts. (1) Suggest reactive arrows to simplify the algorithms for the winning paths. (2) We give a conceptual analysis of (defeasible or nonmonotonic) inheritance diagrams, and compare our analysis to the “small ” and “big sets ” of preferential and related reasoning. In our

U.: Defeasible inheritance-based description logics

by Giovanni Casini, Umberto Straccia - In: IJCAI-11. (2011) 813–818
"... Defeasible inheritance networks are a non-monotonic framework that deals with hierar-chical knowledge. On the other hand, rational closure is acknowledged as a landmark of the preferential approach to non-monotonic reasoning. We will combine these two approaches and define a new non-monotonic closur ..."
Abstract - Cited by 13 (3 self) - Add to MetaCart
Defeasible inheritance networks are a non-monotonic framework that deals with hierar-chical knowledge. On the other hand, rational closure is acknowledged as a landmark of the preferential approach to non-monotonic reasoning. We will combine these two approaches and define a new non

Compiling Defeasible Inheritance Networks to General Logic Programs

by Jia-huai You, Xianchang Wang, Li Yan Yuan - Artificial Intelligence , 1999
"... We present a method of compiling arbitrary defeasible (inheritance) networks to general logic programs. We show a one-to-one 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 - Cited by 6 (1 self) - Add to MetaCart
We present a method of compiling arbitrary defeasible (inheritance) networks to general logic programs. We show a one-to-one correspondence between the credulous extensions of a defeasible network and the stable models of the translated logic program. This result leads to the discovery

Compiling Defeasible Inheritance Networks to General Logic Programs

by Jia-Huai You Xianchang, Jia-huai You, Xianchang Wang, Li Yan Yuan - Artificial Intelligence , 1999
"... We present a method of compiling arbitrary defeasible (inheritance) networks to general logic programs. We show a one-to-one 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 one-to-one correspondence between the credulous extensions of a defeasible network and the stable models of the translated logic program. This result leads to the discovery

The Complexity of Enhanced Path-Based Defeasible Inheritance Network

by Xianchang Wang Jia-Huai, Xianchang Wang, Jia-huai You, Li Yan Yuan
"... 1 Introduction The formal work on complexity so far on path-based defeasible inheritance network concerns purely on Is-A, Is-not-A links. As Selman and Levesque [?] proved, for variety of path-based inheritance definitions, including at least those of [?] and [?], the question of if an extension ex ..."
Abstract - Add to MetaCart
1 Introduction The formal work on complexity so far on path-based defeasible inheritance network concerns purely on Is-A, Is-not-A links. As Selman and Levesque [?] proved, for variety of path-based inheritance definitions, including at least those of [?] and [?], the question of if an extension

Tractable theories of multiple defeasible inheritance in ordinary nonmonotonic logics

by Brian A. Haugh - In AAAI-88 , 1988
"... A suggestion by John McCarthy for general formulations of multiple defeasible inheritance in ordinary nonmonotonic logic is examined and found to suffer from a variety of technical problems, including 1) its restriction to object/class/property networks, 2) unintuitive results in “Nixon diamond”-typ ..."
Abstract - Cited by 11 (0 self) - Add to MetaCart
A suggestion by John McCarthy for general formulations of multiple defeasible inheritance in ordinary nonmonotonic logic is examined and found to suffer from a variety of technical problems, including 1) its restriction to object/class/property networks, 2) unintuitive results in “Nixon diamond

Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence Defeasible Inheritance-Based Description Logics

by Giovanni Casini, Scuola Normale Superiore, Umberto Straccia
"... Defeasible inheritance networks are a nonmonotonic framework that deals with hierarchical knowledge. On the other hand, rational closure is acknowledged as a landmark of the preferential approach. We will combine these two approaches and define a new non-monotonic closure operation for propositional ..."
Abstract - Add to MetaCart
Defeasible inheritance networks are a nonmonotonic framework that deals with hierarchical knowledge. On the other hand, rational closure is acknowledged as a landmark of the preferential approach. We will combine these two approaches and define a new non-monotonic closure operation

A Default Interpretation of Defeasible Network

by Xianchang Wang, Jia-huai You, Li Yan Yuan - 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
Results 1 - 10 of 55