An algebraic graphical model for decision with uncertainties, feasibilities, and utilities

Journal of Artificial Intelligence Research

Volumn 29, Issue , 2007, Pages 421-489

  Pralet, Cédric ^a   Verfaillie, Gérard ^a   Schiex, Thomas ^b  

^a ONERA   (France)

^b CEMAGREF   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION TREES; GRAPH THEORY; PROBLEM SOLVING; SEMANTICS; UNCERTAINTY ANALYSIS;

ALGEBRAIC GRAPHICAL MODELS; DECISION MAKING PROBLEMS; PLAUSIBILITY-FEASIBILITY- UTILITY (PFU) FRAMEWORK; SEQUENTIAL DECISION MAKING;

MATHEMATICAL MODELS;

EID: 34748901181     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.2151     Document Type: Article

References (70)

1. Bacchus, F., & Grove, A. (1995). Graphical Models for Preference and Utility. In Proc. of the 11th International Conference on Uncertainty in Artificial Intelligence (UAI-95), pp. 3-10, Montréal, Canada.
2. Bahar, R., Frohm, E., Gaona, C., Hachtel, G., Macii, E., Pardo, A., & Somenzi, F. (1993). Algebraic Decision Diagrams and Their Applications. In IEEE /ACM International Conference on CAD, pp. 188-191, Santa Clara, California, USA. IEEE Computer Society Press.
3. Bertelé, U., & Brioschi, F. (1972). Nonserial Dynamic Programming. Academic Press.
4. Bistarelli, S., Montanari, U., Rossi, F., Schiex, T., Verfaillie, G., & Fargier, H. (1999). Semiring-Based CSPs and Valued CSPs: Frameworks, Properties and Comparison. Constraints, 4(3), 199-240.
5. Bodlaender, H. (1997). Treewidth: Algorithmic techniques and results. In Proc. of the 22nd International Symposium on Mathematical Foundations of Computer Science (MFCS-97).
6. Bordeaux, L., & Monfroy, E. (2002). Beyond NP: Arc-consistency for Quantified Constraints. In Proc. of the 8th International Conference on Principles and Practice of Constraint Programming (CP-02), Ithaca, New York, USA.
7. Boutilier, C., Brafman, R., Domshlak, C., Hoos, H., & Poole, D. (2004). CP-nets: A Tool for Representing and Reasoning with Conditional Ceteris Paribus Preference Statements. Journal of Artificial Intelligence Research, 21, 135-191.
8. Boutilier, C., Dean, T., & Hanks, S. (1999). Decision-Theoretic Planning: Structural Assumptions and Computational Leverage. Journal of Artificial Intelligence Research, 11, 1-94.
9. Boutilier, C., Dearden, R., & Goldszmidt, M. (2000). Stochastic Dynamic Programming with Factored Representations. Artificial Intelligence, 121(1-2), 49-107.
10. Boutilier, C., Friedman, N., Goldszmidt, M., & Koller, D. (1996). Context-Specific Independence in Bayesian Networks. In Proc. of the 12th International Conference on Uncertainty in Artificial Intelligence (UAI-96), pp. 115-123, Portland, Oregon, USA.
11. Chellappa, R., & Jain, A. (1993). Markov Random Fields: Theory and Applications. Academic Press.
12. Chu, F., & Halpern, J. (2003a). Great Expectations. Part I: On the Customizability of Generalized Expected Utility. In Proc. of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03), Acapulco, Mexico.
13. Chu, F., & Halpern, J. (2003b). Great Expectations. Part II: Generalized Expected Utility as a Universal Decision Rule. In Proc. of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03), pp. 291-296, Acapulco, Mexico.
14. Cooper, M., & Schiex, T. (2004). Arc Consistency for Soft Constraints. Artificial Intelligence, 154(1-2), 199-227.
15. Darwiche, A. (2001). Recursive Conditioning. Artificial Intelligence, 126(1-2), 5-41.
16. Darwiche, A., & Ginsberg, M. (1992). A Symbolic Generalization of Probability Theory. In Proc. of the 10th National Conference on Artificial Intelligence (AAAI-92), pp. 622-627, San Jose, CA, USA.
17. Dechter, R. (1999). Bucket Elimination: a Unifying Framework for Reasoning. Artificial Intelligence, 113(1-2), 41-85.
18. Dechter, R., & Fattah, Y. E. (2001). Topological Parameters for Time-Space Tradeoff. Artificial Intelligence, 125(1-2), 93-118.
19. Dechter, R., & Larkin, D. (2001). Hybrid Processing of Beliefs and Constraints. In Proc. of the 17th International Conference on Uncertainty in Artificial Intelligence (UAI-01), pp. 112-119, Seattle, WA, USA.
20. Dechter, R., & Mateescu, R. (2004). Mixtures of Deterministic- Probabilistic Networks and their AND/OR Search Space. In Proc. of the 20th International Conference on Uncertainty in Artificial Intelligence (UAI-04), Banff, Canada.
21. Demirer, R., & Shenoy, P. (2001). Sequential Valuation Networks: A New Graphical Technique for Asymmetric Decision Problems. In Proc. of the 6th European Conference on Symbolic and Quantitavive Approaches to Reasoning with Uncertainty (ECSQARU-01), pp. 252-265, London, UK.
22. Dubois, D., & Prade, H. (1995). Possibility Theory as a Basis for Qualitative Decision Theory. In Proc. of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95), pp. 1925-1930, Montréal, Canada.
23. Fargier, H., Lang, J., & Schiex, T. (1996). Mixed Constraint Satisfaction: a Framework for Decision Problems under Incomplete Knowledge. In Proc. of the 13th National Conference on Artificial Intelligence (AAAI-96), pp. 175-180, Portland, OR, USA.
24. Fargier, H., & Perny, P. (1999). Qualitative Models for Decision Under Uncertainty without the Commensurability Assumption. In Proc. of the 15th International Conference on Uncertainty in Artificial Intelligence (UAI-99), pp. 188-195, Stockholm, Sweden.
25. Fikes, R., & Nilsson, N. (1971). STRIPS: a New Approach to the Application of Theorem Proving. Artificial Intelligence, 2(3-4), 189-208.
26. Fishburn, P. (1982). The Foundations of Expected Utility. D. Reidel Publishing Company, Dordrecht.
27. Friedman, N., & Halpern, J. (1995). Plausibility Measures: A User's Guide. In Proc. of the 11th International Conference on Uncertainty in Artificial Intelligence (UAI-95), pp. 175-184, Montréal, Canada.
28. Frydenberg, M. (1990). The Chain Graph Markov Property. Scandinavian Journal of Statistics, 17, 333-353.
29. Ghallab, M., Nau, D., & Traverso, P. (2004). Automated Planning: Theory and Practice. Morgan Kaufmann.
30. Giang, P., & Shenoy, P. (2000). A Qualitative Linear Utility Theory for Spohn's Theory of Epistemic Beliefs. In Proc. of the 16th International Conference on Uncertainty in Artificial Intelligence (UAI-00), pp. 220-229, Stanford, California, USA.
31. Giang, P., & Shenoy, P. (2005). Two Axiomatic Approaches to Decision Making Using Possibility Theory. European Journal of Operational Research, 162(2), 450-467.
32. Goldman, R., & Boddy, M. (1996). Expressive Planning and Explicit Knowledge. In Proc. of the 3rd International Conference on Artificial Intelligence Planning Systems (AIPS-96), pp. 110-117, Edinburgh, Scotland.
33. Halpern, J. (2001). Conditional Plausibility Measures and Bayesian Networks. Journal of Artificial Intelligence Research, 14, 359-389.
34. Halpern, J. (2003). Reasoning about Uncertainty. The MIT Press.
35. Howard, R., & Matheson, J. (1984). Influence Diagrams. In Readings on the Principles and Applications of Decision Analysis, pp. 721-762. Strategic Decisions Group, Menlo Park, CA, USA.
36. Jégou, P., & Terrioux, C. (2003). Hybrid Backtracking bounded by Tree-decomposition of Constraint Networks. Artificial Intelligence, 146(1), 43-75.
37. Jensen, F., Nielsen, T., & Shenoy, P. (2004). Sequential Influence Diagrams: A Unified Asymmetry Framework. In Proceedings of the Second European Workshop on Probabilistic Graphical Models (PGM-04), pp. 121-128, Leiden, Netherlands.
38. Jensen, F., & Vomlelova, M. (2002). Unconstrained Influence Diagrams. In Proc. of the 18th International Conference on Uncertainty in Artificial Intelligence (UAI-02), pp. 234-241, Seattle, WA, USA.
39. Kaelbling, L., Littman, M., & Cassandra, A. (1998). Planning and Acting in Partially Observable Stochastic Domains. Artificial Intelligence, 101(1-2), 99-134.
40. Kolhas, J. (2003). Information Algebras: Generic Structures for Inference. Springer.
41. Kushmerick, N., Hanks, S., & Weld, D. (1995). An Algorithm for Probabilistic Planning. Artificial Intelligence, 76(1-2), 239-286.
42. Larrosa, J., & Schiex., T. (2003). In the quest of the best form of local consistency for weighted csp. In Proc. of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03), Acapulco, Mexico.
43. Lauritzen, S., & Nilsson, D. (2001). Representing and Solving Decision Problems with Limited Information. Management Science, 47(9), 1235-1251.
44. Littman, M., Majercik, S., & Pitassi, T. (2001). Stochastic Boolean Satisfiability. Journal of Automated Reasoning, 27(3), 251-296.
45. Mackworth, A. (1977). Consistency in Networks of Relations. Artificial Intelligence, 8(1), 99-118.
46. Monahan, G. (1982). A Survey of Partially Observable Markov Decision Processes: Theory, Models, and Algorithms. Management Science, 28(1), 1-16.
47. Ndilikilikesha, P. (1994). Potential Influence Diagrams. International Journal of Approximated Reasoning, 10, 251-285.
48. Nielsen, T., & Jensen, F. (2003). Representing and solving asymmetric decision problems. International Journal of Information Technology and Decision Making, 2, 217-263.
49. Pearl, J. (1988). Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann.
50. Perny, P., Spanjaard, O., & Weng, P. (2005). Algebraic Markov Decision Processes. In Proc. of the 19th International Joint Conference on Artificial Intelligence (IJCAI-05), Edinburgh, Scotland.
51. Pralet, C. (2006). A Generic Algebraic Framework for Representing and Solving Sequential Decision Making Problems with Uncertainties, Feasibilities, and Utilities. Ph.D. thesis, Ecole Nationale Supérieure de l'Aéronautique et de l'Espace, Toulouse, France.
52. Pralet, C., Schiex, T., & Verfaillie, G. (2006a). Decomposition of Multi-Operator Queries on Semiring-based Graphical Models. In Proc. of the 12th International Conference on Principles and Practice of Constraint Programming (CP-06), pp. 437-452, Nantes, France.
53. Pralet, C., Schiex, T., & Verfaillie, G. (2006b). From Influence Diagrams to Multioperator Cluster DAGs. In Proc. of the 22nd International Conference on Uncertainty in Artificial Intelligence (UAI-06), Cambridge, MA, USA.
54. Pralet, C., Verfaillie, G., & Schiex, T. (2006c). Decision with Uncertainties, Feasibilities, and Utilities: Towards a Unified Algebraic Framework. In Proc. of the 17th European Conference on Artificial Intelligence (ECAI-06), pp. 427-431, Riva del Garda, Italy.
55. Puterman, M. (1994). Markov Decision Processes, Discrete Stochastic Dynamic Programming. John Wiley & Sons.
56. Sabbadin, R. (1999). A Possibilistic Model for Qualitative Sequential Decision Problems under Uncertainty in Partially Observable Environments. In Proc. of the 15th International Conference on Uncertainty in Artificial Intelligence (UAI-99), pp. 567-574, Stockholm, Sweden.
57. Sang, T., Beame, P., & Kautz, H. (2005). Solving Bayesian Networks by Weighted Model Counting. In Proc. of the 20th National Conference on Artificial Intelligence (AAAI-05), pp. 475-482, Pittsburgh, PA, USA.
58. Schmeidler, D. (1989). Subjective Probability and Expected Utility without Additivity. Econometrica, 57(3), 571-587.
59. Schrijver, A. (1998). Theory of Linear and Integer Programming. John Wiley and Sons.
60. Shafer, G. (1976). A Mathematical Theory of Evidence. Princeton University Press.
61. Shenoy, P. (1991). Valuation-based Systems for Discrete Optimization. Uncertainty in Artificial Intelligence, 6, 385-400.
62. Shenoy, P. (1992). Valuation-based Systems for Bayesian Decision Analysis. Operations Research, 40(3), 463-484.
63. Shenoy, P. (1994). Conditional Independence in Valuation-Based Systems. International Journal of Approximated Reasoning, 10(3), 203-234.
64. Shenoy, P. (2000). Valuation Network Representation and Solution of Asymmetric Decision Problems. European Journal of Operational Research, 121, 579-608.
65. Smith, J., Holtzman, S., & Matheson, J. (1993). Structuring Conditional Relationships in Influence Diagrams. Operations Research, 41, 280-297.
66. Spohn, W. (1990). A General Non-Probabilistic Theory of Inductive Reasoning. In Proc. of the 6th International Conference on Uncertainty in Artificial Intelligence (UAI-90), pp. 149-158, Cambridge, MA, USA.
67. von Neumann, J., & Morgenstern, O. (1944). Theory of Games and Economic Behaviour. Princeton University Press.
68. Walsh, T. (2002). Stochastic Constraint Programming. In Proc. of the 15th European Conference on Artificial Intelligence (ECAI-02), pp. 111-115, Lyon, France.
69. Weydert, E. (1994). General Belief Measures. In Proc. of the 10th International Conference on Uncertainty in Artificial Intelligence (UAI-94), pp. 575-582.
70. Wilson, N. (1995). An Order of Magnitude Calculus. In Proc. of the 11th International Conference on Uncertainty in Artificial Intelligence (UAI-95), pp. 548-555, Montréal, Canada.