Skip to main content
Article thumbnail
Location of Repository

The computational complexity of quantified constraint satisfaction

By Hubert Ming Chen

Abstract

The constraint satisfaction problem (CSP) is a framework for modelling search problems. An instance of the CSP consists of a set of variables and a set of constraints on the variables; the question is to decide whether or not there is an assignment to the variables satisfying all of the constraints. The quantified constraint satisfaction problem (QCSP) is a generalization of the CSP in which variables may be both universally and existentially quantified. The general intractability of the CSP and QCSP motivates the search for restricted cases of these problems that are polynomial-time tractable. In thi

Year: 2004
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.3618
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.tecn.upf.es/~hchen/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.