Partial constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
Beyond NP: Arc-Consistency for Quantified Constraints
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
The computational complexity of quantified constraint satisfaction
The computational complexity of quantified constraint satisfaction
QUICKXPLAIN: preferred explanations and relaxations for over-constrained problems
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
CSP properties for quantified constraints: definitions and complexity
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
QCSP-solve: a solver for quantified constraint satisfaction problems
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Value ordering for quantified CSPs
Constraints
Generalizing consistency and other constraint properties to quantified constraints
ACM Transactions on Computational Logic (TOCL)
Cost-driven interactive CSP with constraint relaxation
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
A quantified distributed constraint optimization problem
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
| Hi-index | 0.00 |
The Quantified Constraint Satisfaction Problem (QCSP) is a generalisation of the classical CSP in which some of variables can be universally quantified. In this paper, we extend two well-known concepts in classical constraint satisfaction to the quantified case: problem relaxation and explanation of inconsistency. We show that the generality of the QCSP allows for a number of different forms of relaxation not available in classical CSP. We further present an algorithmfor computing a generalisation of conflict-based explanations of inconsistency for the QCSP.