Preferredwell-foundedsemanticsfor logic programming by alternating fixpoints

We analyze the problem of defining well-founded semantics for ordered logic programs within a general framework based on alternating fixpoint theory. We start by showing that generalizations of existing answer set approaches to preference are too weak in the setting of well-founded semantics. We then specify some informal yet intuitive criteria and propose a semantical framework for preference handling that is more suitable for defining well-founded semantics for ordered logic programs. The suitability of the new approach is convinced by the fact that many attractive properties are satisfied by our semantics. In particular, our semantics is still correct with respect to various existing answer sets semantics while it successfully overcomes the weakness of their generalization to well-founded semantics. Finally, we indicate how an existing preferred well-founded semantics can be captured within our semantical framework.

[1]  Henry Prakken,et al.  Logical Tools for Modelling Legal Argument , 1997 .

[2]  Hans Tompits,et al.  A Generic Approach for Knowledge-Based Information-Site Selection , 2002, International Conference on Principles of Knowledge Representation and Reasoning.

[3]  Franz Baader,et al.  How to Prefer More Specific Defaults in Terminological Default Logic , 1993, IJCAI.

[4]  Gerhard Brewka.  On the Relationship between Defeasible Logic and Well-Founded Semantics , 2001, LPNMR.

[5]  Michael J. Maher,et al.  Efficient Defeasible Reasoning Systems , 2001, Int. J. Artif. Intell. Tools.

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

[7]  Li-Yan Yuan,et al.  Nonmonotonic Reasoning as Prioritized Argumentation , 2001, IEEE Trans. Knowl. Data Eng..

[8]  Cees Witteveen.  Partial Semantics for Truth Maintenance - a Compositional Approach , 1990, JELIA.

[9]  Torsten Schaub,et al.  A Comparative Study of Logic Programs with Preference: Preliminary Report , 2001, Answer Set Programming.

[10]  Michael J. Maher,et al.  A Flexible Framework for Defeasible Logics , 2000, AAAI/IAAI.

[11]  Thomas Eiter,et al.  Prioritizing Default Logic , 2000, Intellectics and Computational Logic.

[12]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[13]  Theresa Swift,et al.  Preference Logic Grammars: Fixed point semantics and application to data standardization , 2002, Artif. Intell..

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

[15]  Gerhard Brewka.  Well-Founded Semantics for Extended Logic Programs with Dynamic Preferences , 1996, J. Artif. Intell. Res..

[16]  John L. Pollock,et al.  Defeasible Reasoning , 2020, Synthese Library.

[17]  Tran Cao Son,et al.  Reasoning with Prioritized Defaults , 1997, LPKR.

[18]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[19]  Allen Van Gelder,et al.  The Alternating Fixpoint of Logic Programs with Negation , 1993, J. Comput. Syst. Sci..

[20]  Robert A. Kowalski,et al.  The Semantics of Predicate Logic as a Programming Language , 1976, JACM.

[21]  Jan Maluszy¿ski,et al.  Prioritized Conflict Handling for Logic Programs , 1997 .

[22]  Jan Maluszy¿ski.  Answer Sets for Prioritized Logic Programs , 1997 .

[23]  Wolfgang Faber,et al.  Disjunctive Logic Programs with Inheritance , 1999, ICLP.

[24]  Michael J. Maher,et al.  Representation results for defeasible logic , 2000, TOCL.

[25]  Fangzhen Lin,et al.  Alternating Fixpoint Theory for Logic Programs with Priority , 2000, Computational Logic.

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

[27]  Thomas Eiter,et al.  Preferred Answer Sets for Extended Logic Programs , 1999, Artif. Intell..

[28]  Hans Tompits,et al.  Logic Programs with Compiled Preferences , 2000, ECAI.

[29]  Chiaki Sakama,et al.  Representing Priorities in Logic Programs , 1996, JICSLP.

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