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

743	First-Order Dynamic Logic - Harel - 1997
627	A companion to modal logic - Hughes, Cresswell - 1984
312	Propositional dynamic logic of regular programs - Fischer, Ladner - 1979
192	Reasoning and Revision in Hybrid Representation Systems - Nebel - 1990
164	The computational complexity of provability in systems of modal propositional logic - Ladner - 1977
148	Attributive concept descriptions with complements - Schmidt-Schau��, Smolka - 1991
80	Models of Program Logic - Pratt - 1979
70	A Guide to the Modal Logics of Knowledge and Belief - Halpern, Moses - 1985
27	Deterministic Propositional Dynamic Logic: Finite Models - Ben-Ari, Halpern, et al. - 1982
22	Algebraic semantics for modal logics I - Lemmon - 1966
15	The taming of the converse: reasoning about two-way computations - Vardi - 1985
2	Propositional Dynamic Logics of Programms: A Survey - Parikh - 1979