Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

CIE
2008
Springer

favoriteEmaildiscussreport

160views Applied Computing» more CIE 2008»

First-Order Model Checking Problems Parameterized by the Model

13 years 4 months ago

First-Order Model Checking Problems Parameterized by the Model

Download www.dur.ac.uk

We study the complexity of the model checking problem, for fixed models A, over certain fragments 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 L. We obtain various full and partial 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

Barnaby Martin

Real-time Traffic

Applied Computing | CIE 2008 | Constraint Satisfaction Problem | First-order Logic | Partial Complexity Classification |

claim paper

Related Content

» Pure Type Systems in Rewriting Logic Specifying Typed HigherOrder Languages in a FirstOrde...

» Decidable FirstOrder Transition Logics for PAProcesses

» Validity of FirstOrder Knowledge Bases

» A FirstOrder Policy Language for HistoryBased Transaction Monitoring

» Compact Labelings For Efficient FirstOrder ModelChecking

» FirstOrder LTL Model Checking Using MDGs

» Model Checking for a FirstOrder Temporal Logic Using Multiway Decision Graphs

» Conflict Detection in Call Control Using FirstOrder Logic Model Checking

» ModelChecking FirstOrder Logic Automata and Locality

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CIE
Authors	Barnaby Martin

Comments (0)