@inproceedings{58e3b8c1b9a547bfbc200b3178f9921d,
title = "A Broad Class of First-Order Rewritable Tuple-Generating Dependencies",
abstract = "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.",
author = "Cristina Civili and Riccardo Rosati",
year = "2012",
doi = "10.1007/978-3-642-32925-8_8",
language = "English",
isbn = "978-3-642-32924-1",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "68--80",
booktitle = "Datalog in Academia and Industry",
address = "United Kingdom",
}