Logic programming with ordered disjunction

Logic programs with ordered disjunction (LPODs) combine ideas underlying Qualitative Choice Logic (Brewka, Benferhat, & Le Berre 2002) and answer set programming. Logic programming under answer set semantics is extended with 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. LPODs are useful for applications in design and configuration and can serve as a basis for qualitative decision making.

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

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

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

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

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

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

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

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

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

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

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

[12]  I. Niemelä,et al.  Extending the Smodels system with cardinality and weight constraints , 2001 .

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

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

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

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

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

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

[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..