Nested Preferences in Answer Set Programming

In this paper, we define a class of nested logic programs, called Nested Logic Programs with Ordered Disjunction (LPODs +), which makes it possible to specify conditional (qualitative) preferences by means of nested preference statements. To this end, we augment the syntax of Logic Programs with Ordered Disjunction (LPODs) to capture more general expressions. We define the LPODs + semantics in a simple way and we extend most of the results of LPODs showing how our approach generalizes the LPODs framework in a proper way. We also show how the LPODs + semantics can be computed in terms of a translation procedure that maps a nested ordered disjunction program (OD +-program) into a disjunctive logic program.

[1]  Miroslaw Truszczynski,et al.  Answer Set Optimization , 2003, IJCAI.

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

[3]  Miroslaw Truszczynski,et al.  Preferences and Nonmonotonic Reasoning , 2008, AI Mag..

[4]  Henri Prade,et al.  Answer Set Programming for Computing Decisions Under Uncertainty , 2011, ECSQARU.

[5]  Vladimir Lifschitz,et al.  Nested expressions in logic programs , 1999, Annals of Mathematics and Artificial Intelligence.

[6]  Stefan Woltran,et al.  A polynomial translation of logic programs with nested expressions into disjunctive logic programs: preliminary report , 2002, NMR.

[7]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[8]  Claudia Zepeda-Cortes.  Evacuation planning using Answer Set Programming , 2005 .

[9]  Didier Dubois,et al.  Towards a Possibilistic Logic Handling of Preferences , 1999, Applied Intelligence.

[10]  Ronen I. Brafman,et al.  CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements , 2011, J. Artif. Intell. Res..

[11]  Souhila Kaci,et al.  Working with Preferences: Less Is More , 2011, Cognitive Technologies.

[12]  Eyke Hüllermeier,et al.  Preferences in AI: An overview , 2011, Artif. Intell..

[13]  Tomi Janhunen.  On the Effect of Default Negation on the Expressiveness of Disjunctive Rules , 2001, LPNMR.

[14]  Pedro Cabalar.  A logical characterisation of ordered disjunction , 2011, AI Commun..

[15]  Chitta Baral,et al.  Knowledge Representation, Reasoning and Declarative Problem Solving , 2003 .

[16]  Henri Prade,et al.  A possibilistic logic view of preference queries to an uncertain database , 2010, International Conference on Fuzzy Systems.

[17]  Elisa Bertino,et al.  PDL with preferences , 2005, Sixth IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY'05).

[18]  Roberto Confalonieri,et al.  Nested logic programs with ordered disjunction , 2010, NMR 2010.

[19]  Christine Solnon,et al.  Applications of Preferences using Answer Set Programming , 2005, Answer Set Programming.

[20]  Henri Prade,et al.  Handling Exceptions in Logic Programming without Negation as Failure , 2011, ECSQARU.

[21]  Stefania Costantini,et al.  Weight Constraints with Preferences in ASP , 2011, LPNMR.

[22]  Mauricio Osorio,et al.  Extended Ordered Disjunction programs to model Preferences , 2011 .

[23]  Stefania Costantini,et al.  Modeling preferences and conditional preferences on resource consumption and production in ASP , 2009, J. Algorithms.

[24]  Nic Wilson,et al.  Extending CP-Nets with Stronger Conditional Preference Statements , 2004, AAAI.

[25]  Salem Benferhat,et al.  Qualitative choice logic , 2004, Artif. Intell..

[26]  Georg Gottlob,et al.  On the computational cost of disjunctive logic programming: Propositional case , 1995, Annals of Mathematics and Artificial Intelligence.

[27]  Juan Carlos Nieves,et al.  Possibilistic Semantics for Logic Programs with Ordered Disjunction , 2010, FoIKS.

[28]  Ilkka Niemelä,et al.  Logic Programs with Ordered Disjunction , 2004, Comput. Intell..