The complexity of reasoning with boolean modal logics (2001)
Cached
Download Links
| Venue: | LTCSReport 00-02, LuFG Theoretical Computer Science, RWTH |
| Citations: | 32 - 5 self |
BibTeX
@INPROCEEDINGS{Lutz01thecomplexity,
author = {Carsten Lutz and Ulrike Sattler},
title = {The complexity of reasoning with boolean modal logics},
booktitle = {LTCSReport 00-02, LuFG Theoretical Computer Science, RWTH},
year = {2001},
publisher = {Publications}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
1 Motivation Since Modal Logics are an extension of Propositional Logic, they provide Boolean operators for constructing complex formulae. However, most Modal Logics do not admit Boolean operators for constructing complex modal parameters to be used in the box and diamond operators. This asymmetry is not present in Boolean Modal Logics, in which box and diamond quantify over arbitrary Boolean combinations of atomic modal parameters [9]. Boolean Modal Logics have been considered in various forms and contexts: 1. "Pure " Boolean Modal Logic has been studied in [9]. Negation and intersection of modal parameters occur in some variants of Propositional Dynamic Logic, see, e.g., [7, 16, 22].
