Computing preferred answer sets by meta-interpretation in answer set programming

Most recently, Answer Set Programming (ASP) has been attracting interest as a new paradigm for problem solving. An important aspect, for which several approaches have been presented, is the handling of preferences between rules. In this paper, we consider the problem of implementing preference handling approaches by means of meta-interpreters in Answer Set Programming. In particular, we consider the preferred answer set approaches by Brewka and Eiter, by Delgrande, Schaub and Tompits, and by Wang, Zhou and Lin. We present suitable meta-interpreters for these semantics using DLV, which is an efficient engine for ASP. Moreover, we also present a meta-interpreter for the weakly preferred answer set approach by Brewka and Eiter, which uses the weak constraint feature of DLV as a tool for expressing and solving an underlying optimization problem. We also consider advanced meta-interpreters, which make use of graph-based characterizations and often allow for more efficient computations. Our approach shows the suitability of ASP in general and of DLV in particular for fast prototyping. This can be fruitfully exploited for experimenting with new languages and knowledge-representation formalisms.

[1]  Victor W. Marek,et al.  On the Expressibility of Stable Logic Programming , 2001, LPNMR.

[2]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

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

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

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

[6]  Wolfgang Faber,et al.  Pushing Goal Derivation in DLP Computations , 1999, LPNMR.

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

[8]  Hans Tompits,et al.  plp: A Generic Compiler for Ordered Logic Programs , 2001, LPNMR.

[9]  Li-Yan Yuan,et al.  Compiling Defeasible Inheritance Networks to General Logic Programs , 1999, Artif. Intell..

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

[11]  Evon M. O. Abu-Taieh,et al.  Comparative Study , 2020, Definitions.

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

[13]  Francesco Buccafurri,et al.  Strong and Weak Constraints in Disjunctive Datalog , 1997, LPNMR.

[14]  Chiaki Sakama,et al.  Prioritized logic programming and its application to commonsense reasoning , 2000, Artif. Intell..

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

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

[17]  Piero A. Bonatti,et al.  Prototypes for Reasoning with Infinite Stable Models and Function Symbols , 2001, LPNMR.

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

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

[20]  Franz Baader,et al.  Priorities on defaults with prerequisites, and their application in treating specificity in terminological default logic , 1995, Journal of Automated Reasoning.

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

[22]  Ilkka Niemelä,et al.  Smodels: A System for Answer Set Programming , 2000, ArXiv.

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

[24]  Francesco Buccafurri,et al.  Semantics and expressiveness of disjunctive ordered logic , 1999, Annals of Mathematics and Artificial Intelligence.

[25]  Wolfgang Faber,et al.  Answer Set Planning under Action Costs , 2002, JELIA.

[26]  Jussi Rintanen.  Lexicographic Priorities in Default Logic , 1998, Artif. Intell..

[27]  Piero A. Bonatti,et al.  Reasoning with infinite stable models , 2001, Artif. Intell..

[28]  Torsten Schaub,et al.  Expressing preferences in default logic , 2000, Artif. Intell..