First-Order Model Checking Problems Parameterized by the Model

DOI10.1007/978-3-540-69407-6_45zbMath1142.68439OpenAlexW2124132452MaRDI QIDQ3507457

Barnaby Martin

Publication date: 19 June 2008

Published in: Logic and Theory of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69407-6_45

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (4)

On the Complexity of the Model Checking Problem ⋮ A parameterized view on the complexity of dependence logic ⋮ Constraint Satisfaction with Counting Quantifiers ⋮ Complexity of existential positive first-order logic

Cites Work

• Unnamed Item
• Unnamed Item
• On the complexity of H-coloring
• Conjunctive-query containment and constraint satisfaction
• Complexity Classifications of Boolean Constraint Satisfaction Problems
• Log Space Recognition and Translation of Parenthesis Languages
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• Computer Science Logic
• Logical Approaches to Computational Barriers
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: First-Order Model Checking Problems Parameterized by the Model