Preferred First-Order Answer Set Programs

In this article, we consider the issue of how first-order answer set programs can be extended for handling preference reasoning. To this end, we propose a progression-based preference semantics for first-order answer set programs while explicit preference relations are presented. We study essential properties of the proposed preferred answer set semantics. To understand the expressiveness of preferred first-order answer set programming, we further specify a second-order logic representation which precisely characterizes the progression-based preference semantics.

[1]  Hans Tompits,et al.  A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning , 2004, Comput. Intell..

[2]  Yan Zhang,et al.  Ordered completion for logic programs with aggregates , 2015, Artif. Intell..

[3]  Richard Kaye,et al.  Automorphisms of first-order structures , 1994 .

[4]  Yi Zhou,et al.  Progression Semantics for Disjunctive Logic Programs , 2011, AAAI.

[5]  Yan Zhang,et al.  On the Progression Semantics and Boundedness of Answer Set Programs , 2010, KR.

[6]  Herbert B. Enderton,et al.  Elements of Recursion Theory , 1977 .

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

[8]  Joohyung Lee,et al.  Stable models and circumscription , 2011, Artif. Intell..

[9]  John McCarthy,et al.  Applications of Circumscription to Formalizing Common Sense Knowledge , 1987, NMR.

[10]  Joohyung Lee,et al.  Situation Calculus as Answer Set Programming , 2010, AAAI.

[11]  Hans Tompits,et al.  A framework for compiling preferences in logic programs , 2002, Theory and Practice of Logic Programming.

[12]  Vladimir Lifschitz,et al.  Closed-World Databases and Circumscription , 1987, Artif. Intell..

[13]  H. Enderton.  Elements of Set Theory , 1977 .

[14]  Yan Zhang,et al.  Logic program-based updates , 2006, TOCL.

[15]  Torsten Schaub,et al.  A semantic framework for preference handling in answer set programming , 2003, Theory and Practice of Logic Programming.

[16]  Yi Zhou,et al.  From Answer Set Logic Programming to Circumscription via Logic of GK , 2007, IJCAI.

[17]  Joohyung Lee,et al.  On Reductive Semantics of Aggregates in Answer Set Programming , 2009, LPNMR.

[18]  Alex M. Andrew,et al.  Knowledge Representation, Reasoning and Declarative Problem Solving , 2004 .

[19]  Gerhard Brewka.  Preferences in Answer Set Programming , 2005, CAEPIA.

[20]  Martin Gebser,et al.  Conflict-Driven Answer Set Solving , 2007, IJCAI.

[21]  Yi Zhou,et al.  Loop-separable programs and their first-order definability , 2011, Artif. Intell..

[22]  Yi Zhou,et al.  Ordered completion for first-order logic programs on finite structures , 2010, Artif. Intell..