Name
Abstract | ||
|---|---|---|
We study the complexity of model expansion (MX), which is the problem of expanding a given finite structure with additional relations to produce a finite model of a given formula. This is the logical task underlying many practical constraint languages and systems for representing and solving search problems, and our work is motivated by the need to provide theoretical foundations for these. We present results on both data and combined complexity of MX for several fragments and extensions of FO that are relevant for this purpose, in particular the guarded fragment GFk of FO and extensions of FO and GFk with inductive definitions. We present these in the context of the two closely related, but more studied, problems of model checking and finite satisfiability. To obtain results on FO(ID), the extension of FO with inductive definitions, we provide translations between FO(ID) with FO(LFP), which are of independent interest. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-16242-8_32 | LPAR (Yogyakarta) |
Keywords | Field | DocType |
satisfiability,model checking | Finite satisfiability,Model checking,Computer science,Algorithm,Theoretical computer science | Conference |
Volume | ISSN | ISBN |
6397 | 0302-9743 | 3-642-16241-X |
Citations | PageRank | References |
4 | 0.44 | 18 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Antonina Kolokolova | 1 | 50 | 10.09 |
| yongmei liu | 2 | 307 | 31.79 |
| David G. Mitchell | 3 | 1567 | 237.86 |
| Eugenia Ternovska | 4 | 211 | 15.05 |