Tableaux for temporal description logic with constant domains

Lutz, C. and Sturm, H. and Wolter, F. and Zakharyaschev, Michael (2001) Tableaux for temporal description logic with constant domains. In: Gore, R. and Leitsch, A. and Nipkow, T. (eds.) IJCAR: Automated Reasoning, First International Joint Conference. Lecture Notes in Computer Science 2083. Springer, pp. 121-136. ISBN 9783540422549.

Full text not available from this repository.

Official URL: https://doi.org/10.1007/3-540-45744-5_10

Abstract

We show how to combine the standard tableau system for the basic description logic ALC and Wolper’s tableau calculus for proposi- tional temporal logic PTL (with the temporal operators ‘next-time’ and ‘until’) in order to design a terminating sound and complete tableau- based satisfiability-checking algorithm for the temporal description logic PTL ALC of [20] interpreted in models with constant domains. We use the method of quasimodels [18,16] to represent models with in finite domains, and the technique of minimal types [11] to maintain these domains constant. The combination is flexible and can be extended to more expressive description logics or even to decidable fragments of first-order temporal logics.

Metadata

Item Type:	Book Section
School:	Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User:	Sarah Hall
Date Deposited:	08 Nov 2021 15:08
Last Modified:	09 Aug 2023 12:52
URI:	https://eprints.bbk.ac.uk/id/eprint/46631

Statistics

Archive Staff Only (login required)

Edit/View Item