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
Personalized query relaxations and repairs in knowledge-based recommendation
Proceedings of the third ACM conference on Recommender systems
| Hi-index | 0.00 |
The Quantified CSP (QCSP) is a generalisation of the classical CSP in which some of the variables are universally quantified [3].We consider the problem of relaxing an instance of the QCSP when it is unsatisfiable. We propose several novel forms of problem relaxations for the QCSP and present an algorithm for generating conflict-based explanations of inconsistency. Our motivation comes from problems in supply-chain management and conformant planning.