Alternating Fixpoint Theory for Logic Programs with Priority

van Gelder's alternating fixpoint theory has proven to be a very useful tool for unifying and characterizing various semantics for logic programs without priority. In this paper we propose an extension of van Gelder's alternating fixpoint theory and show that it can be used as a general semantic framework for logic programs with priority. Specifically, we define three declarative and model-theoretic semantics in this framework for prioritied logic programs: prioritized answer sets, prioritized regular extensions and prioritized well-founded model. We show that all of these semantics are natural generalizations of the corresponding semantics for logic programs without priority. We also show that these semantics have some other desirable properties. In particular, they can handle conflicts caused indirectly by the priorities.

[1]  Dirk Vermeir,et al.  A Fixpoint Semantics for Ordered Logic , 1990, J. Log. Comput..

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

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

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

[5]  Victor W. Marek,et al.  Logic Programs, Well-Orderings, and Forward Chaining , 1999, Ann. Pure Appl. Log..

[6]  Victor W. Marek,et al.  Basic Forward Chaining Construction for Logic Programs , 1997, LFCS.

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

[8]  Li-Yan Yuan,et al.  Disjunctive Logic Programming as Constrained Inferences , 1997, ICLP.

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

[10]  John McCarthy,et al.  SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE , 1987 .

[11]  Victor W. Marek,et al.  Stable models and an alternative logic programming paradigm , 1998, The Logic Programming Paradigm.

[12]  Jorge Lobo,et al.  Defeasible Specifications in Action Theories , 1997, IJCAI.

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

[14]  Li-Yan Yuan,et al.  Three-valued formalization of logic programming: is it needed? , 1990, PODS '90.

[15]  Kewen Wang,et al.  Argumentation-based abduction in disjunctive logic programming , 2000, J. Log. Program..

[16]  Dov M. Gabbay,et al.  Credulous vs. Sceptical Semantics for Ordered Logic Programs , 1991, KR.

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

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

[19]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[20]  Fangzhen Lin,et al.  Embracing Causality in Specifying the Indirect Effects of Actions , 1995, IJCAI.

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

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

[23]  Sakti Pramanik,et al.  Reliable Semantics for Extended Logic Programs with Rule Prioritization , 1995, J. Log. Comput..