Blocksorted quantified conjunctive queries
Chen, Hubie and Marx, Dániel (2013) Blocksorted quantified conjunctive queries. In: Automata, Languages, and Programming. 40th International Colloquium, ICALP 2013, Riga, Latvia, July 812, 2013, Proceedings, Part II. Lecture Notes in Computer Science (7966). SpringerVerlag Wien, Berlin, pp. 125136. ISBN 9783642392115 10.1007/9783642392122_14

Text
Chen_125_2476629_ny.pdf Download (326kB)  Preview 
Abstract
We study the complexity of model checking in quantified conjunctive logic, that is, the fragment of firstorder logic where both quantifiers may be used, but conjunction is the only permitted connective. In particular, we study blocksorted queries, which we define to be prenex sentences in multisorted relational firstorder 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 blocksorted queries of bounded arity on which model checking is fixedparameter 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 SpringerVerlag.
Item Type:  Book Section 

Subjects:  Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány 
Divisions:  Informatics Laboratory 
SWORD Depositor:  MTMT Injector 
Depositing User:  MTMT Injector 
Date Deposited:  07 Feb 2018 06:59 
Last Modified:  21 Jul 2019 13:45 
URI:  https://eprints.sztaki.hu/id/eprint/9349 
Update Item 