Reasoning with Prioritized Defaults

The purpose of this paper is to investigate the methodology of reasoning with prioritized defaults in the language of logic programs under the answer set semantics. We present a domain independent system of axioms, written as an extended logic program, which defines reasoning with prioritized defaults. These axioms are used in conjunction with a description of a particular domain encoded in a simple language allowing representation of defaults and their priorities. Such domain descriptions are of course domain dependent and should be specified by the users. We give sufficient conditions for consistency of domain descriptions and illustrate the use of our system by formalizing various examples from the literature. Unlike many other approaches to formalizing reasoning with priorities ours does not require development of the new semantics of the language. Instead, the meaning of statements in the domain description is given by the system of (domain independent) axioms. We believe that in many cases this leads to simpler and more intuitive formalization of reasoning examples. We also present some discussion of differences between various formalizations.

[1]  Henry Prakken,et al.  Argument-Based Extended Logic Programming with Defeasible Priorities , 1997, J. Appl. Non Class. Logics.

[2]  Weidong Chen,et al.  Extending Prolog with Nonmonotonic Reasoning , 1996, J. Log. Program..

[3]  Peter C. Fishburn,et al.  Nonlinear preference and utility theory , 1988 .

[4]  Olga Kosheleva,et al.  Algorithmic problems of nontransitive (SSB) utilities , 1991 .

[5]  Phan Minh Dung,et al.  On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning and Logic Programming , 1993, IJCAI.

[6]  Thomas F. Gordon,et al.  Pleadings game - an artificial intelligence model of procedural justice , 1995 .

[7]  Phan Minh Dung,et al.  On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games , 1995, Artif. Intell..

[8]  Torsten Schaub,et al.  Compiling Reasoning with and about Preferences into Default Logic , 1997, IJCAI.

[9]  Sarit Kraus,et al.  Nonmonotonic Reasoning, Preferential Models and Cumulative Logics , 1990, Artif. Intell..

[10]  Alfredo Gabaldon,et al.  From Functional Specifications to Logic Programms , 1997, ILPS.

[11]  Vladimir Lifschitz,et al.  Splitting a Logic Program , 1994, ICLP.

[12]  Chitta Baral,et al.  Logic Programming and Knowledge Representation , 1994, J. Log. Program..

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

[14]  Alfredo Gabaldon,et al.  From Functional Speci cations to Logic Programs , .

[15]  Jürgen Dix,et al.  A Disjunctive Semantics Bases on Unfolding and Bottom-Up Evaluation , 1994, GI Jahrestagung.

[16]  Donald Nute,et al.  Prolog Programming in Depth , 1988 .

[17]  Phan Minh Dung,et al.  On the Relations between Stable and Well-Founded Semantics of Logic Programs , 1992, Theor. Comput. Sci..

[18]  François Fages,et al.  Consistency of Clark's completion and existence of stable models , 1992, Methods Log. Comput. Sci..

[19]  Henry Prakken,et al.  On the relation between legal language and legal argument: assumptions, applicability and dynamic priorities , 1995, ICAIL '95.

[20]  Norman Y. Foo,et al.  Answer Sets for Prioritized Logic Programs , 1997, ILPS.

[21]  Donald Nute,et al.  A decidable quantified defeasible logic , 1995 .

[22]  Dov M. Gabbay,et al.  Theoretical Foundations for Non-Monotonic Reasoning in Expert Systems , 1989, Logics and Models of Concurrent Systems.

[23]  Jürgen Dix,et al.  A Classification Theory of Semantics of Normal Logic Programs: I. Strong Properties , 1995, Fundam. Informaticae.

[24]  David Pearce,et al.  A New Logical Characterisation of Stable Models and Answer Sets , 1996, NMELP.

[25]  Gerhard Brewka.  Reasoning about Priorities in Default Logic , 1994, AAAI.

[26]  DungPhan Minh.  On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games , 1995 .

[27]  Jürgen Dix,et al.  Characterizations of the Stable Semantics by Partial Evaluation , 1994, LPNMR.

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

[29]  David Nelson,et al.  Constructible falsity , 1949, Journal of Symbolic Logic.

[30]  Raymond Reiter.  On Closed World Data Bases , 1977, Logic and Data Bases.

[31]  Jürgen Dix,et al.  Characterizations of the Disjunctive Stable Semantics by Partial Evaluation , 1997, J. Log. Program..

[32]  Benjamin N. Grosof.  Prioritized Conflict Handling for Logic Programs , 1997, ILPS.

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

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

[35]  David Scott Warren,et al.  Query evaluation under the well-founded semantics , 1993, PODS.