Chen, Hubie (2014) The tractability frontier of graph-like first-order query sets. In: UNSPECIFIED (ed.) CSL-LICS '14 Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). New York, U.S.: ACM Publications. ISBN 9781450328869.
|
Text
graphlike-post.pdf - Author's Accepted Manuscript Download (322kB) | Preview |
Abstract
We study first-order model checking, by which we refer to the problem of deciding whether or not a given first-order sentence is satisfied by a given finite structure. In particular, we aim to understand on which sets of sentences this problem is tractable, in the sense of parameterized complexity theory. To this end, we define the notion of a graph-like sentence set, which definition is inspired by previous work on first-order model checking wherein the permitted connectives and quantifiers were restricted. Our main theorem is the complete tractability classification of such graphlike sentence sets, which is (to our knowledge) the first complexity classification theorem concerning a class of sentences that has no restriction on the connectives and quantifiers. To present and prove our classification, we introduce and develop a novel complexity-theoretic framework which is built on parameterized complexity and includes new notions of reduction.
Metadata
| Item Type: | Book Section |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Business and Law > Birkbeck Business School Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Hubie Chen |
| Date Deposited: | 20 Apr 2018 13:12 |
| Last Modified: | 09 Aug 2023 12:43 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/21933 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
