Mixed Constraint Satisfaction: A Framework for Decision Problems under Incomplete Knowledge

Constraint satisfaction is a powerful tool for representing and solving decision problems with complete knowledge about the world. We extend the CSP framework so as to represent decision problems under incomplete knowledge. The basis of the extension consists in a distinction between controllable and uncontrollable variables -- hence the terminology "mixed CSP" -- and a "solution" gives actually a conditional decision. We study the complexity of deciding the consistency of a mixed CSP. As the problem is generally intractable, we propose an algorithm for finding an approximate solution.

[1]  Francesca Rossi,et al.  Constraint Solving over Semirings , 1995, IJCAI.

[2]  Mary P. Harper,et al.  An Approach to Multiply Segmented Constraint Satisfaction Problems , 1994, AAAI.

[3]  David Poole,et al.  Exploiting the Rule Structure for Decision Making within the Independent Choice Logic , 1995, UAI.

[4]  Thomas Schiex,et al.  A constraint satisfaction framework for decision under uncertainty , 1995, UAI.

[5]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[6]  D. Dubois,et al.  Constraint satisfaction and decision under uncertainty based on qualitative possibility theory , 1997, Proceedings of 6th International Fuzzy Systems Conference.

[7]  Rina Dechter,et al.  Belief Maintenance in Dynamic Constraint Networks , 1988, AAAI.

[8]  Thomas Schiex,et al.  Valued Constraint Satisfaction Problems: Hard and Easy Problems , 1995, IJCAI.

[9]  Nageshwara Rao Vempaty.  Solving Constraint Satisfaction Problems Using Finite State Automata , 1992, AAAI.

[10]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

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

[12]  Eugene C. Freuder,et al.  Extracting Constraint Satisfaction Subproblems , 1995, IJCAI.

[13]  Richard J. Wallace,et al.  Partial Constraint Satisfaction , 1989, IJCAI.

[14]  V. N. Rao,et al.  Solving constraint satisfaction problems using finite state automata , 1992, AAAI 1992.

[15]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..