| Carsten Lutz, Holger Sturm, Frank Wolter, and Michael Zakharyaschev. A tableau calculus for temporal description logic: the constant domain case. In Proceedings of IJCAR'2001. |
....particular, temporal epistemic logics of [6] For instance, 11] gives a solution to the open problem of Baader and Laux [4] by constructing tableaux for their combination of the modal logic K with ALC interpreted in models with constant domains. The paper is accompanied by a technical report [12] containing full proofs of all theorems. 2 Basic de nitions We begin by introducing the temporal description logic PTLALC of [20] Let NC = fC 0 ; C 1 ; g, NR = fR 0 ; R 1 ; g, and NO = fa 0 ; a 1 ; g be countably in nite sets of concept names, role names, and object names, ....
....which, given a PTLALC formula #, decides whether # is satis able. 6 Conclusion This paper a continuation of the series [14, 4, 16, 11] develops a tableau reasoning procedure for the temporal description logic PTLALC interpreted in twodimensional models with constant ALC domains. As shown in [12], the algorithm runs in double exponential time thus paralleling the complexity of Wolper s original PTL algorithm [17] which solves a PSpace complete problem using exponential time. Despite the high complexity, we believe that the devised tableau algorithm is an important rst step towards the ....
C. Lutz, H. Sturm, F. Wolter, and M. Zakharyaschev. A tableau calculus for temporal description logic: The constant domain case. See http://www-lti.informatik.rwthaachen. de/Forschung/Reports.html.
No context found.
Carsten Lutz, Holger Sturm, Frank Wolter, and Michael Zakharyaschev. A tableau calculus for temporal description logic: the constant domain case. In Proceedings of IJCAR'2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC