Chen, H and Marx, Dániel (2013) Block-sorted quantified conjunctive queries. In: Lecture Notes in Computer Science, 2013-07-08 - 2013-07-12, Riga, Litvánia.

Full text not available from this repository.

Abstract

We study the complexity of model checking in quantified conjunctive logic, that is, the fragment of first-order logic where both quantifiers may be used, but conjunction is the only permitted connective. In particular, we study block-sorted queries, which we define to be prenex sentences in multi-sorted relational first-order logic where two variables having the same sort must appear in the same quantifier block. We establish a complexity classification theorem that describes precisely the sets of block-sorted queries of bounded arity on which model checking is fixed-parameter tractable. This theorem strictly generalizes, for the first time, the corresponding classification for existential conjunctive logic (which is known and due to Grohe) to a logic in which both quantifiers are present. © 2013 Springer-Verlag.

Item Type:	Conference or Workshop Item (-)
Subjects:	Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Depositing User:	EPrints Admin
Date Deposited:	05 Feb 2014 12:32
Last Modified:	05 Feb 2014 15:46
URI:	https://eprints.sztaki.hu/id/eprint/7633

Update Item