TY - GEN
T1 - A Broad Class of First-Order Rewritable Tuple-Generating Dependencies
AU - Civili, Cristina
AU - Rosati, Riccardo
PY - 2012
Y1 - 2012
N2 - We study reasoning, and in particular query answering, over databases with tuple-generating dependencies (TGDs). Our focus is on classes of TGDs for which conjunctive query answering is first-order rewritable, i.e., can be reduced to the standard evaluation of a first-order query over the database. In this paper, we define the class of weakly recursive TGDs, and prove that this class comprises and generalizes every previously known FOL-rewritable class of TGDs, under fairly general assumptions on the form of the TGDs.
AB - We study reasoning, and in particular query answering, over databases with tuple-generating dependencies (TGDs). Our focus is on classes of TGDs for which conjunctive query answering is first-order rewritable, i.e., can be reduced to the standard evaluation of a first-order query over the database. In this paper, we define the class of weakly recursive TGDs, and prove that this class comprises and generalizes every previously known FOL-rewritable class of TGDs, under fairly general assumptions on the form of the TGDs.
U2 - 10.1007/978-3-642-32925-8_8
DO - 10.1007/978-3-642-32925-8_8
M3 - Conference contribution
SN - 978-3-642-32924-1
T3 - Lecture Notes in Computer Science
SP - 68
EP - 80
BT - Datalog in Academia and Industry
PB - Springer Berlin Heidelberg
ER -