{"type":"ScholarlyArticle","title":"Quantified Constraint Satisfaction Problems: From Relaxations to Explanations","authors":[{"name":"Alex Ferguson","slug":"alex-ferguson","given":"Alex","family":"Ferguson","affiliation":""},{"name":"Barry O'Sullivan","slug":"barry-o-apos-sullivan","given":"Barry","family":"O'Sullivan","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2007/10","pdf":"https://ijcai.org/proceedings/2007/0010.pdf","markdown":"https://ijcai.org/proceedings/2007/10.md","bibtex":"https://ijcai.org/proceedings/2007/bibtex/10","volume":{"slug":"2007","title":"Proceedings of the Twentieth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2007","url":"https://ijcai.org/proceedings/2007/","year":2007,"location":"Hyderabad, India","dates":"","editors":"Ramon López de Mántaras","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":10,"pages":{"first":74,"last":78},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}