Disjunctive Deductive Databases for Computing Certain and Consistent Answers to Queries from Mediated Data Integration Systems (0)
| Venue: | Journal of Applied Logic |
| Citations: | 16 - 3 self |
BibTeX
@ARTICLE{Bravo_disjunctivedeductive,
author = {Loreto Bravo and Leopoldo Bertossi},
title = {Disjunctive Deductive Databases for Computing Certain and Consistent Answers to Queries from Mediated Data Integration Systems},
journal = {Journal of Applied Logic},
year = {},
volume = {3},
pages = {329--367}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We address the problem of retrieving certain and consistent answers to queries posed to a mediated data integration system with open sources under the local-as-view paradigm using conjunctive and disjunctive view definitions. For obtaining certain answers a query program is run on top of a normal deductive database with choice that defines the class of minimal legal instances of the integration system under the cautious stable model semantics. This methodology works for all monotone Datalog queries. To compute answers to queries that are consistent wrt given global integrity constraints, the specification of minimal legal instances is combined with another disjunctive deductive database that specifies the repairs of those legal instances. This allows to retrieve the consistent answers to any Datalog query, for any set of universal and acyclic referential integrity constraints.
