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.
Keywords Philosophy   Logic   Artificial Intelligence   Semantics
Categories (categorize this paper)
DOI 10.1007/s10849-005-5787-x
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 69,114
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

On the Restraining Power of Guards.Erich Grädel - 1999 - Journal of Symbolic Logic 64 (4):1719-1742.

View all 11 references / Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
24 ( #470,945 of 2,499,195 )

Recent downloads (6 months)
1 ( #419,059 of 2,499,195 )

How can I increase my downloads?

Downloads

My notes