Talks and Poster Presentations (with Proceedings-Entry):

S. Ahmetaj, D. Calvanese, M. Ortiz de la Fuente, M. Simkus:
"Planning Problems for Graph Structured Data in Description Logics";
Talk: 27th International Workshop on Description Logics, Vienna, Austria; 07-17-2014 - 07-20-2014; in: "Informal Proceedings of the 27th International Workshop on Description Logics", M. Bienvenu, M. Ortiz de la Fuente, R. Rosati, M. Simkus (ed.); CEUR-WS, Vol-1193 (2014), ISSN: 1613-0073; 4 - 7.

English abstract:
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.

Graph structured data, Planning, Action languages, Static analysis

Electronic version of the publication:

Related Projects:
Project Head M.Magdalena Ortiz de la Fuente:
Rekursive Abfrage über semantisch angereicherte Datenbestände

Project Head Reinhard Pichler:
Effiziente, parametrisierte Algorithmen in Künstlicher Intelligenz und logischem Schließen

Project Head Reinhard Pichler:
SEE: SPARQL Evaluation and Extensions

Created from the Publication Database of the Vienna University of Technology.