Quantified Equality Constraints

Authors:
Manuel Bodirsky;Hubie Chen
Affiliations:
Humboldt-Universitat zu Berlin, Germany;Universitat Pompeu Fabra, Spain
Venue:
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Year:
2007

Citing 0
Cited 4

Quantified Positive Temporal Constraints

CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Tractable Quantified Constraint Satisfaction Problems over Positive Temporal Templates

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
A rendezvous of logic, complexity, and algebra

ACM Computing Surveys (CSUR)
Qualitative temporal and spatial reasoning revisited

CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

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.