eCommons

 

Quantified Constraint Satisfaction Problems: Closure Properties, Complexity, and Proof Systems

Other Titles

Author(s)

Abstract

There has been much prior work on understanding the complexity of the constraint satisfaction problem (CSP), a broad framework capturing many combinatorial problems. This paper studies a natural and strict generalization of the CSP, the quantified constraint satisfaction problem (QCSP). In the CSP, all variables are existentially quantified; in the QCSP, some variables may be universally quantified. Our contributions include proof systems for the QCSP and the identification of three broad tractable subclasses of the QCSP. Central to our study is the algebraic notion of closure properties of constraints, which has been previously used to study the CSP.

Journal / Series

Volume & Issue

Description

Sponsorship

Date Issued

2003-04-18

Publisher

Cornell University

Keywords

computer science; technical report

Location

Effective Date

Expiration Date

Sector

Employer

Union

Union Local

NAICS

Number of Workers

Committee Chair

Committee Co-Chair

Committee Member

Degree Discipline

Degree Name

Degree Level

Related Version

Related DOI

Related To

Related Part

Based on Related Item

Has Other Format(s)

Part of Related Item

Related To

Related Publication(s)

Link(s) to Related Publication(s)

References

Link(s) to Reference(s)

Previously Published As

http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cis/TR2003-1895

Government Document

ISBN

ISMN

ISSN

Other Identifiers

Rights

Rights URI

Types

technical report

Accessibility Feature

Accessibility Hazard

Accessibility Summary

Link(s) to Catalog Record