A tableau decision algorithm for modalized ALC with constant domains
Lutz, C. and Sturm, H. and Wolter, F. and Zakharyaschev, Michael (2002) A tableau decision algorithm for modalized ALC with constant domains. Studia Logica 72 (2), pp. 199-232. ISSN 0039-3215.
Abstract
The aim of this paper is to construct a tableau decision algorithm for the modal description logic K ALC with constant domains. More precisely, we present a tableau procedure that is capable of deciding, given an ALC-formula ϕ with extra modal operators (which are applied only to concepts and TBox axioms, but not to roles), whether ϕ is satisfiable in a model with constant domains and arbitrary accessibility relations. Tableau-based algorithms have been shown to be 'practical' even for logics of rather high complexity. This gives us grounds to believe that, although the satisfiability problem for K ALC is known to be NEXPTIME-complete, by providing a tableau decision algorithm we demonstrate that highly expressive description logics with modal operators have a chance to be implementable. The paper gives a solution to an open problem of Baader and Laux [5].
Metadata
| Item Type: | Article |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 01 Nov 2021 15:30 |
| Last Modified: | 09 Aug 2023 12:52 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/46568 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
 |
Edit/View Item |