Name
Abstract | ||
|---|---|---|
We prove ExpTime-membership of the satisfiability problem for loosely 驴-guarded first-order formulas with a bounded number of variables and an unbounded number of constants. Guarded fragments with constants are interesting by themselves and because of their connection to hybrid logic. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/s10849-005-5787-x | Journal of Logic, Language and Information |
Keywords | Field | DocType |
guarded fragment,hybrid logic,complexity | Predicate transformer semantics,Discrete mathematics,Hybrid logic,Boolean satisfiability problem,Mathematics,Semantics,Bounded function | Journal |
Volume | Issue | Citations |
14 | 3 | 6 |
PageRank | References | Authors |
0.63 | 7 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Balder Ten Cate | 1 | 630 | 51.21 |
| Massimo Franceschet | 2 | 658 | 39.91 |