Bridging the gap between modal temporal logics and constraint-based QSR as an ALC(D) spatio-temporalisation with weakly cyclic TBoxes

Simple item page
dc.creatorIsli, Amar
dc.date2003-07-17
dc.date.accessioned2026-07-07T03:20:04Z
dc.date.available2026-07-07T03:20:04Z
dc.descriptionThe aim of this work is to provide a family of qualitative theories for spatial change in general, and for motion of spatial scenes in particular. To achieve this, we consider a spatio-temporalisation MTALC(D_x), of the well-known ALC(D) family of Description Logics (DLs) with a concrete domainan. In particular, the concrete domain D_x is generated by a qualitative spatial Relation Algebra (RA) x. We show the important result that satisfiability of an MTALC(D_x) concept with respect to a weakly cyclic TBox is decidable in nondeterministic exponential time, by reducing it to the emptiness problem of a weak alternating automaton augmented with spatial constraints, which we show to remain decidable, although the accepting condition of a run involves, additionally to the standard case, consistency of a CSP (Constraint Satisfaction Problem) potentially infinite. The result provides an effective tableaux-like satisfiability procedure which is discussed.
dc.description58 pages, 7 figures (I have only split each of Figures 1, 2 and 3, as it appears in the first version, into two figures, so that the number of figures is now 7 instead of the original 4 -it is expected that the reader will find the look of the paper better)
dc.identifierhttps://arxiv.org/abs/cs/0307040
dc.identifierhttp://arxiv.org/abs/cs/0307040
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31702
dc.subjectArtificial Intelligence
dc.subjectLogic in Computer Science
dc.subjectI.2 (I.2.4)
dc.titleBridging the gap between modal temporal logics and constraint-based QSR as an ALC(D) spatio-temporalisation with weakly cyclic TBoxes
dc.typetext

Files

Collections

arXiv