DocumentCode
3112721
Title
Quantified Equality Constraints
Author
Bodirsky, Manuel ; Chen, Hubie
Author_Institution
Humboldt-Univ. zu Berlin, Berlin
fYear
2007
fDate
10-14 July 2007
Firstpage
203
Lastpage
212
Abstract
An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities. We prove a complete complexity classification for quantified constraint satisfaction problems (QCSPs) over equality templates: these problems are in L (decidable in logarithmic space), NP-complete, or PSPACE-complete. To establish our classification theorem we combine methods from universal algebra with concepts from model theory.
Keywords
constraint handling; constraint theory; optimisation; NP-complete; PSPACE-complete; complexity classification; constraint satisfaction problems; logarithmic space; quantified equality constraints; relational structure; Algebra; Computer science; Constraint theory; Logic; Performance analysis;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science, 2007. LICS 2007. 22nd Annual IEEE Symposium on
Conference_Location
Wroclaw
ISSN
1043-6871
Print_ISBN
0-7695-2908-9
Type
conf
DOI
10.1109/LICS.2007.38
Filename
4276565
Link To Document