Logic in Computer Science, Symposium on (2013)
New Orleans, LA, USA USA
June 25, 2013 to June 28, 2013
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LICS.2013.61
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.
Databases, Data structures, Boolean functions, Controllability, Context, Finite element analysis, Computer science, Finite Controllability, Tuple generating dependencies, Sticky Logic
Tomasz Gogacz, Jerzy Marcinkowski, "Converging to the Chase -- A Tool for Finite Controllability", Logic in Computer Science, Symposium on, vol. 00, no. , pp. 540-549, 2013, doi:10.1109/LICS.2013.61