Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
An approach to multiply segmented constraint satisfaction problems
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Partial constraint satisfaction
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Extracting constraint satisfaction subproblems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Constraint solving over semirings
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Solving constraint satisfaction problems using finite state automata
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
A constraint satisfaction framework for decision under uncertainty
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Exploiting the rule structure for decision making within the independent choice logic
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Two forms of dependence in propositional logic: controllability and definability
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Branching Constraint Satisfaction Problems for Solutions Robust under Likely Changes
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Certainty closure: Reliable constraint reasoning with incomplete or erroneous data
ACM Transactions on Computational Logic (TOCL)
A theoretic and practical framework for scheduling in a stochastic environment
Journal of Scheduling
Decision with uncertainties, feasibilities, and utilities: towards a unified algebraic framework
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
A Markovian model for dynamic and constrained resource allocation problems
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Extensions of simple conceptual graphs: the complexity of rules and constraints
Journal of Artificial Intelligence Research
An algebraic graphical model for decision with uncertainties, feasibilities, and utilities
Journal of Artificial Intelligence Research
A general framework for scheduling in a stochastic environment
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Realtime online solving of quantified CSPs
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Constraint-muse: a soft-constraint based system for music therapy
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
A model for dynamic reconfiguration in service-oriented architectures
ECSA'10 Proceedings of the 4th European conference on Software architecture
Engineering Applications of Artificial Intelligence
BlockSolve: a bottom-up approach for solving quantified CSPs
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Conditional and composite temporal CSPs
Applied Intelligence
Possibility theory for reasoning about uncertain soft constraints
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Constraint reasoning with uncertain data using CDF-Intervals
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Dynamic SAT with decision change costs: formalization and solutions
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
| Hi-index | 0.00 |
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.