9 citations · 10 across the 3 of their papers we have counts for
3 papers
Data complexity of answering conjunctive queries over SHIQ knowledge bases
M. Magdalena Ortiz de la Fuente, Diego Calvanese, Thomas Eiter +1
An algorithm for answering conjunctive queries over SHIQ knowledge bases that is coNP in data complexity is given. The algorithm is based on the tableau algorithm for reasoning wit…
Complexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity Constraints
L. Bertossi, L. Bravo, E. Franconi +1
Consistent query answering is the problem of computing the answers from a database that are consistent with respect to certain integrity constraints that the database as a whole ma…
A Robust and Computational Characterisation of Peer-to-Peer Database Systems
Enrico Franconi, Gabriel Kuper, Andrei Lopatenko +1
In this paper we give a robust logical and computational characterisation of peer-to-peer database systems. We first define a pre- cise model-theoretic semantics of a peer-to-peer…