PP-2004-32: ten Cate, Balder and Franceschet, Massimo (2004) Guarded fragments with constants. [Report]
Preview |
Text (Full Text)
PP-2004-32.text.pdf Download (158kB) | Preview |
![[thumbnail of Abstract]](https://eprints.illc.uva.nl/style/images/fileicons/text.png) |
Text (Abstract)
PP-2004-32.abstract.txt Download (417B) |
Abstract
We prove EXPTIME-completeness of the satisfiability problem for
guarded and loosely guarded first-order formulas with a bounded number
of variables and an unbounded number of constants. Guarded fragments
with constants are interesting because of their connection to hybrid
logic.
| Item Type: | Report |
|---|---|
| Report Nr: | PP-2004-32 |
| Series Name: | Prepublication (PP) Series |
| Year: | 2004 |
| Uncontrolled Keywords: | guarded fragment; complexity; hybrid logic |
| Subjects: | Logic |
| Date Deposited: | 12 Oct 2016 14:36 |
| Last Modified: | 12 Oct 2016 14:36 |
| URI: | https://eprints.illc.uva.nl/id/eprint/143 |
Actions (login required)
 |
View Item |
