A Correspondence Theory for Terminological Logics: Preliminary Report (1991) [215 citations — 0 self]
Abstract:
We show that the terminological logic ALC comprising Boolean operations on concepts and value restrictions is a notational variant of the propositional modal logic K (m) . To demonstrate the utility of the correspondence, we give two of its immediate by-products. Namely, we axiomatize ALC and give a simple proof that subsumption in ALC is PSPACE-complete, replacing the original six-page one. Furthermore, we consider an extension of ALC additionally containing both the identity role and the composition, union, transitive-reflexive closure, range restriction, and inverse of roles. It turns out that this language, called T SL, is a notational variant of the propositional dynamic logic converse- PDL. Using this correspondence, we prove that it suffices to consider finite T SL-models, show that T SL-subsumption is decidable, and obtain an axiomatization of T SL. By discovering that features correspond to deterministic programs in dynamic logic, we show that adding them to T SL preserves...
Citations
| 644 | Dynamic logic – Harel - 1984 |
| 568 | A New Introduction to Modal Logic – Hughes, Cresswell - 1996 |
| 260 | The propositional dynamic logic of regular programs – Fischer, Ladner - 1979 |
| 189 | Reasoning and Revision in Hybrid Representation Systems. Lecture Notes in – Nebel - 1990 |
| 150 | Smolka: Attribute concept descriptions with complements – Schmidt-Schau, G - 1991 |
| 147 | The computational complexity of provability in systems of modal propositional logic – Ladner - 1977 |
| 76 | Models of program logics – Pratt - 1979 |
| 73 | A Guide to the Modal Logics of Knowledge and Belief – Halpern, Moses - 1985 |
| 25 | 1982], ‘Deterministic propositional dynamic logic: Finite models, complexity, and completeness – Ben-Ari, Halpern, et al. |
| 23 | Algebraic Semantics for Modal Logics I – Lemmon - 1966 |
| 14 | The taming of converse: Reasoning about two-way computations – Vardi |
| 2 | Propositional Dynamic Logics of Programms: A Survey – Parikh - 1979 |

