- Titel
- A Tableau Algorithm for the Clique Guarded Fragment
- Untertitel
- Preliminary Version
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa2-789041
- Schriftenreihe
- LTCS-Report
- Bandnummer
- 00-03
- Erstveröffentlichung
- 2000
- DOI
- https://doi.org/10.25368/2022.106
- Abstract (EN)
- Aus der Einleitung: „The Guarded Fragment of first-order logic, introduced by Andréka, van Benthem, and Németi, has been a succesful attempt to transfer many good properties of modal, temporal, and description logics to a larger fragment of predicate logic. Among these are decidability, the finite modal property, invariance under an appropriate variant of bisimulation, and other nice modal theoretic properties. ...”
- Freie Schlagwörter (DE)
- Prädikatenlogik, Bisimulation, bewachte Logik
- Freie Schlagwörter (EN)
- predicate logic, bisimulation, guarded logic
- Klassifikation (DDC)
- 004
- Klassifikation (RVK)
- ST 136
- Publizierende Institution
- Aachen University of Technology, Aachen
- Version / Begutachtungsstatus
- angenommene Version / Postprint / Autorenversion
- URN Qucosa
- urn:nbn:de:bsz:14-qucosa2-789041
- Veröffentlichungsdatum Qucosa
- 20.05.2022
- Dokumenttyp
- Bericht
- Sprache des Dokumentes
- Englisch
- Lizenz / Rechtehinweis
CC BY 4.0