DocumentCode
3092672
Title
An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction
Author
Chen, Hubie ; Müller, Moritz
Author_Institution
Univ. Pompeu Fabra, Barcelona, Spain
fYear
2012
fDate
25-28 June 2012
Firstpage
215
Lastpage
224
Abstract
We prove a preservation theorem for positive Horn definability in aleph-zero categorical structures. In particular, we define and study a construction which we call the periodic power of a structure, and define a periomorphism of a structure to be a homomorphism from the periodic power of the structure to the structure itself. Our preservation theorem states that, over an aleph-zero categorical structure, a relation is positive Horn definable if and only if it is preserved by all periomorphisms of the structure. We give applications of this theorem, including a new proof of the known complexity classification of quantified constraint satisfaction on equality templates.
Keywords
algebra; constraint satisfaction problems; aleph-zero categorical quantified constraint satisfaction; aleph-zero categorical structures; algebraic preservation theorem; complexity classification; homomorphism; periomorphism; positive Horn definability; Cloning; Computational complexity; Context; Electronic mail; Periodic structures; aleph-zero categoricity; computational complexity; periodic power; preservation theorem; quantified constraint satisfaction;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science (LICS), 2012 27th Annual IEEE Symposium on
Conference_Location
Dubrovnik
ISSN
1043-6871
Print_ISBN
978-1-4673-2263-8
Type
conf
DOI
10.1109/LICS.2012.32
Filename
6280440
Link To Document