Quantified equality constraints

Bodirsky, M. and Chen, Hubie (2007) Quantified equality constraints. In: UNSPECIFIED (ed.) LICS 2007: 22nd IEEE Symposium on Logic in Computer Science. IEEE Computer Society, pp. 203-212. ISBN 0769529089.

Full text not available from this repository.

Official URL: https://doi.org/10.1109/LICS.2007.38

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.

Metadata

Item Type:	Book Section
School:	School of Business, Economics & Informatics > Computer Science and Information Systems
Depositing User:	Sarah Hall
Date Deposited:	02 Mar 2021 19:24
Last Modified:	02 Mar 2021 19:32
URI:	https://eprints.bbk.ac.uk/id/eprint/43275

Statistics

Archive Staff Only (login required)

Edit/View Item