Quantified Constraint Satisfaction Problems: From Relaxations to Explanations
Abstract
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.
Cite
Text
Ferguson and O'Sullivan. "Quantified Constraint Satisfaction Problems: From Relaxations to Explanations." International Joint Conference on Artificial Intelligence, 2007.Markdown
[Ferguson and O'Sullivan. "Quantified Constraint Satisfaction Problems: From Relaxations to Explanations." International Joint Conference on Artificial Intelligence, 2007.](https://mlanthology.org/ijcai/2007/ferguson2007ijcai-quantified/)BibTeX
@inproceedings{ferguson2007ijcai-quantified,
title = {{Quantified Constraint Satisfaction Problems: From Relaxations to Explanations}},
author = {Ferguson, Alex and O'Sullivan, Barry},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2007},
pages = {74-79},
url = {https://mlanthology.org/ijcai/2007/ferguson2007ijcai-quantified/}
}