Logical Representation and Computation of Optimal Decisions in a Qualitative Setting

This paper describes a logical machinery for computing decisions based on an ATMS procedure, 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). The preferences of the user are also described by another possibilistic logic base whose formula weights are interpreted in terms of priorities and formulas express goals. Two attitudes are allowed for the decision maker: a pessimistic uncertainty-averse one and an optimistic one. The computed decisions are in agreement with a qualitative counterpart to classical expected utility theory for decision under uncertainty.

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

[2]  Ronen I. Brafman,et al.  On the Axiomatization of Qualitative Decision Criteria , 1997, AAAI/IAAI.

[3]  Oskar Dressler.  Assumption-Based Truth Maintenance , 1986, Begründungsverwaltung.

[4]  Didier Dubois,et al.  Nonmonotonic Reasoning, Conditional Objects and Possibility Theory , 1997, Artif. Intell..

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

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

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

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

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

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

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

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

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

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

[15]  Claudette Cayrol,et al.  Using the Davis and Putnam Procedure for an Efficient Computation of Preferred Models , 1996, ECAI.

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

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

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