Bisimulations on Data Graphs

Sergio Abriola (1) , Pablo Barceló (2) , Diego Figueira (3, 4) , Santiago Figueira (1, 5)

1 UBA - Universidad de Buenos Aires [Buenos Aires]
2 UCHILE - Universidad de Chile = University of Chile [Santiago]
3 CNRS - Centre National de la Recherche Scientifique
4 LaBRI - Laboratoire Bordelais de Recherche en Informatique
5 CONICET - Consejo Nacional de Investigaciones Científicas y Técnicas [Buenos Aires]

Bisimulation provides structural conditions to characterize indistinguishability between nodes on graph-like structures from an external observer. It is a fundamental notion used in many areas. However, many applications use graphs where nodes have data, and where observers can test for equality or inequality of data values (e.g., asking the attribute 'name' of a node to be different from that of all its neighbors). The present work constitutes a first investigation of " data aware " bisimulations on data graphs. We study the problem of computing such bisimulations, based on the observational in-distinguishability for XPath —a language that extends modal logic with tests for data equality. We show that in general the problem is PSPACE-complete, but identify several restrictions that yield better complexity bounds (CO-NP, PTIME) by controlling suitable parameters of the problem; namely, the amount of non-locality allowed, and the class of models considered (graph, DAG, tree). In particular, this analysis yields a hierarchy of tractable fragments.

Domaines: Base de données [cs.DB]; Théorie et langage formel [cs.FL]; Mathématique discrète [cs.DM]; Logique en informatique [cs.LO]

Sergio Abriola, Pablo Barceló, Diego Figueira, Santiago Figueira. Bisimulations on Data Graphs. International Conference on Principles of Knowledge Representation and Reasoning (KR), Apr 2016, Cape Town, South Africa. pp.309-318. ⟨hal-01713325⟩