=Paper= {{Paper |id=Vol-1577/invited_paper_2 |storemode=property |title=Managing Change in Graph-structured Data Using Description Logics |pdfUrl=https://ceur-ws.org/Vol-1577/invited_paper_2.pdf |volume=Vol-1577 |authors=Diego Calvanese |dblpUrl=https://dblp.org/rec/conf/dlog/Calvanese16 }} ==Managing Change in Graph-structured Data Using Description Logics== https://ceur-ws.org/Vol-1577/invited_paper_2.pdf
Managing Change in Graph-structured Data
        Using Description Logics

                             Diego Calvanese

    KRDB Research Centre, Free University of Bozen-Bolzano, Italy
                    calvanese@inf.unibz.it



 Abstract. Graph-structured data, which are receiving increased atten-
 tion in the database community, are tightly connected to Description
 Logics (DLs), given that these two formalims share the underlying in-
 terpretation structures. In this talk, we consider the challenging setting
 of graph-structured data that evolve as a result of update operations
 adding and deleting facts in the style of action languages, under con-
 straints capturing domain knowledge. We argue that expressive variants
 of DLs provide indeed quite powerful mechanisms for expressing forms of
 constraints over graph-structured data, and we draw interesting connec-
 tions to path-constraints studied in databases. In this setting we discuss
 two fundamental reasoning tasks, considering both lightweight and ex-
 pressive variants of DLs: verification, i.e., checking the consistency of a
 sequence of operations with respect to constraints; and plan existence,
 i.e., existence of a sequence of operations leading to a goal state.