Computer Science – Logic in Computer Science
Scientific paper
2006-09-06
Computer Science
Logic in Computer Science
Scientific paper
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.
No associations
LandOfFree
Dichotomies and Duality in First-order Model Checking Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Dichotomies and Duality in First-order Model Checking Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dichotomies and Duality in First-order Model Checking Problems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-418296