%0 Journal Article %1 paper:ferguson:2004 %A Ferguson, Alex %A O’Sullivan, Barry %D 2006 %J Principles and Practice of Constraint Programming - CP 2006 %K CSP ds explanations relaxation repairs %P 690--694 %T Relaxations and Explanations for Quantified Constraint Satisfaction Problems %U http://dx.doi.org/10.1007/11889205_52 %X 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 ofproblem relaxations for the QCSP and present an algorithm for generating conflict-based explanations of inconsistency. Ourmotivation comes from problems in supply-chain management and conformant planning.

@article{paper:ferguson:2004, abstract = {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 ofproblem relaxations for the QCSP and present an algorithm for generating conflict-based explanations of inconsistency. Ourmotivation comes from problems in supply-chain management and conformant planning.}, added-at = {2009-07-24T18:37:21.000+0200}, author = {Ferguson, Alex and O’Sullivan, Barry}, biburl = {https://www.bibsonomy.org/bibtex/2f11969d1ddaf0c7c357d7700ff39f6ff/mschuber}, description = {SpringerLink - Book Chapter}, interhash = {391865e39b24bee53d296b9c7aa46a75}, intrahash = {f11969d1ddaf0c7c357d7700ff39f6ff}, journal = {Principles and Practice of Constraint Programming - CP 2006}, keywords = {CSP ds explanations relaxation repairs}, pages = {690--694}, timestamp = {2009-07-24T18:37:21.000+0200}, title = {Relaxations and Explanations for Quantified Constraint Satisfaction Problems}, url = {http://dx.doi.org/10.1007/11889205_52}, year = 2006 }