Planning Problems for Graph Structured Data in Description Logics

Proc. of the 27th Int. Workshop on Description Logics (DL 2014). Volume 1193 of CEUR Workshop Proceedings, https://ceur-ws.org/. 2014.

We consider the setting of graph-structured data that evolve as a result of operations carried out by users or applications. We rely on a simple yet powerful action language in which actions are finite sequences of insertions and deletions of nodes and labels, and on the use of Description Logics for describing integrity constraints and (partial) states of the data. For this setting, we study variants of planning problems, which range from ensuring the satisfaction of a given set of integrity constraints after executing a given sequence of actions, to deciding the existence of a sequence of actions that takes the data to an (un)desirable state, starting either from a specific data instance or from an incomplete description of it. For these problems we establish (un)decidability results and study the computational complexity, also considering various restrictions.

@inproceedings{DL-2014-graph-dbs,
   title = "Planning Problems for Graph Structured Data in Description
Logics",
   year = "2014",
   author = "Shqiponja Ahmetaj and Diego Calvanese and Magdalena Ortiz
and Mantas Simkus",
   booktitle = "Proc. of the 27th Int. Workshop on Description Logics
(DL 2014)",
   pages = "4--7",
   volume = "1193",
   publisher = "CEUR-WS.org",
   series = "CEUR Workshop Proceedings, https://ceur-ws.org/",
}