Logic in Computer Science, Symposium on (2013)

New Orleans, LA, USA USA

June 25, 2013 to June 28, 2013

ISSN: 1043-6871

ISBN: 978-1-4799-0413-6

pp: 540-549

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LICS.2013.61

ABSTRACT

We solve a problem, stated in [CGP10], showing that Sticky Datalog exists, defined in the cited paper as an element of the Datalog pm project, has the finite controllability property. In order to do that, we develop a technique, which we believe can have further applications, of approximating Chase(D, cal T), for a database instance D and a set of tuple generating dependencies and data log rules cal T, by an infinite sequence of finite structures, all of them being models of cal T and D.

INDEX TERMS

Databases, Data structures, Boolean functions, Controllability, Context, Finite element analysis, Computer science, Finite Controllability, Tuple generating dependencies, Sticky Logic

CITATION

T. Gogacz and J. Marcinkowski, "Converging to the Chase -- A Tool for Finite Controllability,"

*Logic in Computer Science, Symposium on(LICS)*, New Orleans, LA, USA USA, 2013, pp. 540-549.

doi:10.1109/LICS.2013.61

CITATIONS