A spatio-temporalisation of ALC(D) and its translation into alternating automata augmented with spatial constraints

02/22/2020
by   Amar Isli, et al.
0

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(Dx), of the well-known ALC(D) family of Description Logics (DLs) with a concrete domain: the MTALC(Dx) concepts are interpreted over infinite k-ary Sigma-trees, with the nodes standing for time points, and Sigma including, additionally to its uses in classical k-ary Sigma-trees, the description of the snapshot of an n-object spatial scene of interest; the roles split into m+n immediate-successor (accessibility) relations, which are serial, irreflexive and antisymmetric, and of which m are general, not necessarily functional, the other n functional; the concrete domain Dx is generated by an RCC8-like spatial Relation Algebra (RA) x, and is used to guide the change by imposing spatial constraints on objects of the "followed" spatial scene, eventually at different time points of the input trees. In order to capture the expressiveness of most modal temporal logics encountered in the literature, we introduce weakly cyclic Terminological Boxes (TBoxes) of MTALC(Dx), whose axioms capture the decreasing property of modal temporal operators. We show the important result that satisfiability of an MTALC(Dx) concept with respect to a weakly cyclic TBox can be reduced to the emptiness problem of a Buchi weak alternating automaton augmented with spatial constraints. In another work, complementary to this one, also submitted to this conference, we thoroughly investigate Buchi automata augmented with spatial constraints, and provide, in particular, a translation of an alternating into a nondeterministic, and an effective decision procedure for the emptiness problem of the latter.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/10/2023

Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures

We introduce the class of tree constraint automata with data values in Z...
research
09/25/2012

A Cookbook for Temporal Conceptual Data Modelling with Description Logics

We design temporal description logics suitable for reasoning about tempo...
research
06/30/2022

Reasoning in Non-normal Modal Description Logics

Non-normal modal logics, interpreted on neighbourhood models which gener...
research
04/19/2023

The Krohn-Rhodes Logics

We present a new family of modal temporal logics of the past, obtained b...
research
10/24/2017

Bottom-up automata on data trees and vertical XPath

A data tree is a finite tree whose every node carries a label from a fin...

Please sign up or login with your details

Forgot password? Click here to reset