Quantified Constraint Satisfaction Problems: From Relaxations to Explanations
Proceedings of the Twentieth International Joint Conference on Artificial Intelligence. Pages 74-78.
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.
@inproceedings{ijcai2007p10,
title = {Quantified Constraint Satisfaction Problems: From Relaxations to Explanations},
author = {Ferguson, Alex and O'Sullivan, Barry},
booktitle = {Proceedings of the Twentieth International Joint Conference on
Artificial Intelligence, {IJCAI-07}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Ramon López de Mántaras},
pages = {74--78},
year = {2007},
url = {https://ijcai.org/proceedings/2007/10},
}
TY - CPAPER TI - Quantified Constraint Satisfaction Problems: From Relaxations to Explanations AU - Ferguson, Alex AU - O'Sullivan, Barry T2 - Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07 PB - International Joint Conferences on Artificial Intelligence PY - 2007 SP - 74 EP - 78 UR - https://ijcai.org/proceedings/2007/10 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
