Computer Science – Artificial Intelligence
Scientific paper
2003-07-17
Computer Science
Artificial Intelligence
58 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 th
Scientific paper
The 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.
No associations
LandOfFree
Bridging the gap between modal temporal logics and constraint-based QSR as an ALC(D) spatio-temporalisation with weakly cyclic TBoxes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Bridging the gap between modal temporal logics and constraint-based QSR as an ALC(D) spatio-temporalisation with weakly cyclic TBoxes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bridging the gap between modal temporal logics and constraint-based QSR as an ALC(D) spatio-temporalisation with weakly cyclic TBoxes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-151839