First-order model checking problems parameterized by the model

Martin, Barnaby (2008) First-order model checking problems parameterized by the model. In: The 4th Conference on Computability in Europe: Logic and Theory of Algorithms (CiE 2008), 15-20 June, 2008, University of Athens, Greece. (doi:10.1007/978-3-540-69407-6_45)

Full text is not in this repository.

Abstract

We study the complexity of the model checking problem, for fixed models <em>A</em>, over certain fragments $\mathcal{L}$ of first-order logic, obtained by restricting which of the quantifiers and boolean connectives we permit. These are sometimes known as the expression complexities of $\mathcal{L}$. We obtain various full and partial complexity classification theorems for these logics $\mathcal{L}$ as each ranges over models <em>A</em>, in the spirit of the dichotomy conjecture for the Constraint Satisfaction Problem --- which itself may be seen as the model checking problem for existential conjunctive positive first-order logic.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Martin B. (2008) First-Order Model Checking Problems Parameterized by the Model. In: Beckmann A., Dimitracopoulos C., Löwe B. (eds) Logic and Theory of Algorithms. CiE 2008. Lecture Notes in Computer Science, vol 5028. Springer, Berlin, Heidelberg
Research Areas: A. > School of Science and Technology > Computer Science
A. > School of Science and Technology > Computer Science > Foundations of Computing group
Item ID: 9755
Useful Links:
Depositing User: Devika Mohan
Date Deposited: 10 Jan 2013 06:08
Last Modified: 24 Apr 2018 15:25
ISBN: 9783540694052
URI: https://eprints.mdx.ac.uk/id/eprint/9755

Actions (login required)

Edit Item Edit Item