Mostrar el registro sencillo del ítem
An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction
dc.contributor.author | Chen, Hubert | |
dc.contributor.author | Müller, Moritz | |
dc.date.accessioned | 2014-02-07T17:47:10Z | |
dc.date.available | 2014-02-07T17:47:10Z | |
dc.date.issued | 2013-03-29 | |
dc.identifier.citation | Logical Methods in Computer Science 9(1) : (2013) // Article N. 15 | es |
dc.identifier.issn | 1860-5974 | |
dc.identifier.uri | http://hdl.handle.net/10810/11388 | |
dc.description | 23 p. -- An extended abstract of this work appears in the proceedings of the 2012 ACM/IEEE Symposium on Logic in Computer Science | es |
dc.description.abstract | We prove an algebraic 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. | es |
dc.description.sponsorship | The first author was partially supported by the Spanish program "Ramon y Cajal" and MICINN grant TIN2010-20967-C04-02. The first author was also supported by by Spanish Project FORMALISM(TIN2007-66523), by the Basque Government Project S-PE12UN050(SAI12/219), and by the University of the Basque Country under grant UFI11/45. The second author thanks the FWF (Austrian Science Fund) for its support through Project P 24654 N25. | es |
dc.language.iso | eng | es |
dc.publisher | Logical Methods in Computer Science c/o Institut f. Theoretische Informatik, Technische Universität Braunschweig | es |
dc.rights | info:eu-repo/semantics/openAccess | es |
dc.subject | algebraic preservation theorem | es |
dc.subject | quantified constraint satisfaction | es |
dc.subject | polymorphisms | es |
dc.subject | complexity classification | es |
dc.title | An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction | es |
dc.type | info:eu-repo/semantics/article | es |
dc.rights.holder | © H. Chen and M. Müller. This work is licensed under the Creative Commons Attribution-NoDerivs License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nd/2.0/ or send a letter to Creative Commons, 171 Second St, Suite 300, San Fra ncisco, CA 94105, USA, or Eisenacher Strasse 2, 10777 Berlin, Germany | es |
dc.relation.publisherversion | http://www.lmcs-online.org/ojs/viewarticle.php?id=1223&layout=abstract | es |
dc.identifier.doi | 10.2168/LMCS-9(1:15)2013 | |
dc.departamentoes | Lenguajes y sistemas informáticos | es_ES |
dc.departamentoeu | Hizkuntza eta sistema informatikoak | es_ES |
dc.subject.categoria | COMPUTER SCIENCE, MULTIDISCIPLINARY | |
dc.subject.categoria | THEORETICAL COMPUTER SCIENCE |