Lexicographic Priorities in Default Logic

Abstract Resolving conflicts between default rules is a major subtask in performing default reasoning. A declarative way of controlling the resolution of conflicts is to assign priorities to default rules, and to prevent conflict resolution in ways that violate the priorities. This work extends Reiter's default logic with a priority mechanism that is based on lexicographic comparison. Given a default theory and a partial ordering on the defaults, the preferred extensions are the lexicographically best extensions. We discuss alternative ways of using lexicographic comparison, and investigate their properties and relations between them. The applicability of the priority mechanism to inheritance reasoning is investigated by presenting two translations from inheritance networks to prioritized default theories, and relating them to inheritance theories presented earlier by Gelfond and Przymusinska and by Brewka.

[1]  Didier Dubois,et al.  Inconsistency Management and Prioritized Syntax-Based Entailment , 1993, IJCAI.

[2]  Gerhard Brewka,et al.  Preferred Subtheories: An Extended Logical Framework for Default Reasoning , 1989, IJCAI.

[3]  Gerhard Brewka,et al.  The Logic of Inheritance in Frame Systems , 1987, IJCAI.

[4]  John McCarthy,et al.  Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

[5]  M. Gelfond,et al.  Disjunctive Defaults , 1991 .

[6]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[7]  Raymond Reiter,et al.  On Interacting Defaults , 1981, IJCAI.

[8]  Mark Ryan,et al.  Representing Defaults as Sentences with Reduced Priority , 1992, KR.

[9]  Andrew B. Baker,et al.  A Theorem Prover for Prioritized Circumscription , 1989, IJCAI.

[10]  Raymond Reiter,et al.  A Theory of Diagnosis from First Principles , 1986, Artif. Intell..

[11]  Vladimir Lifschitz,et al.  Computing Circumscription , 1985, IJCAI.

[12]  Jussi Rintanen.  Complexity of Prioritized Default Logics , 1998, J. Artif. Intell. Res..

[13]  David Poole,et al.  A Logical Framework for Default Reasoning , 1988, Artif. Intell..

[14]  Michael Maher.  Efficient Implementation of the Well-founded and Stable Model Semantics , 1996 .

[15]  Michael Gelfond,et al.  Formalization of inheritance reasoning in autoepistemic logic , 1990 .

[16]  Kurt Konolige,et al.  On the Relation Between Default and Autoepistemic Logic , 1987, Artif. Intell..

[17]  Victor W. Marek,et al.  Nonmonotonic logic - context-dependent reasoning , 1997, Artificial intelligence.

[18]  David S. Touretzky,et al.  A Clash of Intuitions: The Current State of Nonmonotonic Multiple Inheritance Systems , 1987, IJCAI.

[19]  Dov M. Gabbay,et al.  Handbook of Logic in Artificial Intelligence and Logic Programming: Volume 3: Nonmonotonic Reasoning and Uncertain Reasoning , 1994 .

[20]  Gerhard Brewka,et al.  Handling Partially Ordered Defaults in TMS , 1991, ECSQARU.

[21]  Gerhard Brewka,et al.  Adding Priorities and Specificity to Default Logic , 1994, JELIA.

[22]  Gerhard Brewka,et al.  Nonmonotonic Reasoning: Logical Foundations of Commonsense By Gerhard Brewka (Cambridge University Press, 1991) , 1991, SGAR.

[23]  Hector Geffner,et al.  Conditional Entailment: Bridging two Approaches to Default Reasoning , 1992, Artif. Intell..

[24]  John F. Horty,et al.  Some direct theories of nonmonotonic inheritance , 1994 .

[25]  P. Simons.  Eecient Implementation of the Well- Founded and Stable Model Seman- Tics , 1996 .

[26]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[27]  Robert C. Moore.  Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.

[28]  John McCarthy,et al.  Circumscription—a form of non-monotonic reasoning , 1987 .

[29]  Teodor C. Przymusinski.  On the Declarative Semantics of Deductive Databases and Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

[30]  Jack Minker.  Foundations of deductive databases and logic programming , 1988 .