Using Possibilistic Logic for Modeling Qualitative Decision: ATMS-based Algorithms

This paper describes a logical machinery for computing decisions, where the available knowledge on the state of the world is described by a possibilistic propositional logic base (i.e., a collection of logical statements associated with qualitative certainty levels), and where the preferences of the user are also described by another possibilistic logic base whose formula weights are interpreted in terms of priorities. Two attitudes are allowed for the decision maker: a pessimistic risk-averse one and an optimistic one. The computed decisions are in agreement with a qualitative counterpart to the classical theory of expected utility, recently developed by three of the authors. A link is established between this logical view of qualitative decision making and an ATMS-based computation procedure. Efficient algorithms for computing pessimistic and optimistic optimal decisions are finally given in this logical setting (using some previous work of the fourth author).

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

[2]  Didier Dubois,et al.  COMBINING HYPOTHETICAL REASONING and PLAUSIBLE INFERENCE IN POSSIBILISTIC LOGIC , 1996 .

[3]  D. Dubois,et al.  Decision-making under ordinal preferences and uncertainty , 1997 .

[4]  Didier Dubois,et al.  Decision-Making under Ordinal Preferences and Comparative Uncertainty , 1997, UAI.

[5]  Luca Console,et al.  Readings in Model-Based Diagnosis , 1992 .

[6]  Jérôme Lang,et al.  Towards qualitative approaches to multi-stage decision making , 1998, Int. J. Approx. Reason..

[7]  Judea Pearl,et al.  Qualitative Decision Theory , 1994, AAAI.

[8]  Blai Bonet,et al.  Arguing for Decisions: A Qualitative Model of Decision Making , 1996, UAI.

[9]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[10]  Ronen I. Brafman,et al.  On the Foundations of Qualitative Decision Theory , 1996, AAAI/IAAI, Vol. 2.

[11]  Jérôme Lang,et al.  Possibilistic logic as a logical framework for min-max discrete optimisation problems and prioritized constraints , 1991, FAIR.

[12]  Robert Schrag,et al.  Compilation for Critically Constrained Knowledge Bases , 1996, AAAI/IAAI, Vol. 1.

[13]  Didier Dubois,et al.  Representing Default Rules in Possibilistic Logic , 1992, KR.

[14]  Didier Dubois,et al.  Automated Reasoning Using Possibilistic Logic: Semantics, Belief Revision, and Variable Certainty Weights , 1994, IEEE Trans. Knowl. Data Eng..

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

[16]  Didier Dubois,et al.  Possibility Theory as a Basis for Qualitative Decision Theory , 1995, IJCAI.

[17]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[18]  Johan de Kleer,et al.  Extending the ATMS , 1986, Artif. Intell..

[19]  Didier Dubois,et al.  Practical model-based diagnosis with qualitative possibilistic uncertainty , 1995, UAI.

[20]  Didier Dubois,et al.  Qualitative Decision Theory with Sugeno Integrals , 1998, UAI.

[21]  Didier Dubois,et al.  A Possibilistic Logic Machinery for Qualitative Decision , 1997, AAAI 1997.

[22]  Judea Pearl,et al.  System Z: a Natural Ordering of Defaults with Tractable Applications to Nonmonotonic Reasoning^ , 1990 .

[23]  Judea Pearl,et al.  From Conditional Oughts to Qualitative Decision Theory , 1993, UAI.

[24]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[25]  Chu Min Li,et al.  Heuristics Based on Unit Propagation for Satisfiability Problems , 1997, IJCAI.

[26]  Johan de Kleer,et al.  An Assumption-Based TMS , 1987, Artif. Intell..

[27]  Didier Dubois,et al.  Logical Representation and Computation of Optimal Decisions in a Qualitative Setting , 1998, AAAI/IAAI.