Dichotomies and Duality in First-order Model Checking Problems
计算机科学中的逻辑
2007-05-23 v2 计算复杂性
摘要
We study the complexity of the model checking problem, for fixed model A, over certain fragments L of first-order logic. These are sometimes known as the expression complexities of L. We obtain various complexity classification theorems for these logics L as each ranges over models A, 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.
引用
@article{arxiv.cs/0609022,
title = {Dichotomies and Duality in First-order Model Checking Problems},
author = {Barnaby Martin},
journal= {arXiv preprint arXiv:cs/0609022},
year = {2007}
}