Answer Sets and Qualitative Decision Making

Logic programs under answer set semantics have become popular as a knowledge representation formalism in Artificial Intelligence. In this paper we investigate the possibility of using answer sets for qualitative decision making. Our approach is based on an extension of the formalism, called logic programs with ordered disjunction (LPODs). These programs contain a new connective called ordered disjunction. The new connective allows us to represent alternative, ranked options for problem solutions in the heads of rules: A × B intuitively means: if possible A, but if A is not possible then at least B. The semantics of logic programs with ordered disjunction is based on a preference relation on answer sets. We show that LPODs can serve as a basis for qualitative decision making.

[1]  Gerald Pfeifer,et al.  The KR System dlv: Progress Report, Comparisons and Benchmarks , 1998, KR.

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

[3]  Didier Dubois,et al.  Using Possibilistic Logic for Modeling Qualitative Decision: ATMS-based Algorithms , 1999, Fundam. Informaticae.

[4]  Tod S. Levitt,et al.  Uncertainty in artificial intelligence , 1988 .

[5]  Didier Dubois,et al.  Decision, nonmonotonic reasoning and possibilistic logic , 2000 .

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

[7]  Ronen I. Brafman,et al.  Reasoning With Conditional Ceteris Paribus Preference Statements , 1999, UAI.

[8]  Jérôme Lang,et al.  Conditional Desires and Utilities: an Alternative Logical Approach to Qualitative Decision Theory , 1996, ECAI.

[9]  Chiaki Sakama,et al.  An alternative approach to the semantics of disjunctive logic programs and deductive databases , 2004, Journal of Automated Reasoning.

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

[11]  Craig Boutilier,et al.  Toward a Logic for Qualitative Decision Theory , 1994, KR.

[12]  Ilkka Niemelä,et al.  Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs , 2002, JELIA.

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

[14]  David Poole,et al.  The Independent Choice Logic for Modelling Multiple Agents Under Uncertainty , 1997, Artif. Intell..

[15]  Gerhard Brewka,et al.  Logic programming with ordered disjunction , 2002, NMR.

[16]  Ilkka Niemelä,et al.  Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP , 1997, LPNMR.

[17]  Gian Luigi Ferrari,et al.  Parameterized Structured Operational Semantics , 1998, Fundam. Informaticae.

[18]  Vladimir Lifschitz,et al.  Answer set programming and plan generation , 2002, Artif. Intell..

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

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

[21]  Jon Doyle,et al.  Background to Qualitative Decision Theory , 1999, AI Mag..

[22]  Leon van der Torre,et al.  Parameters for Utilitarian Desires in a Qualitative Decision Theory , 2001, Applied Intelligence.

[23]  Benjamin N. Grosof.  DIPLOMAT: Compiling Prioritized Default Rules into Ordinary Logic Programs, for E-Commerce Applications , 1999, AAAI/IAAI.

[24]  L. J. Savage,et al.  The Foundations of Statistics , 1955 .