Deductive databases for computing certain and consistent answers from mediated data integration systems
Journal of Applied Logic , Volume 3 - Issue 2 SPEC. ISS. p. 329- 367
We address the problem of retrieving certain and consistent answers to queries posed to a mediated data integration system under the local-as-view paradigm with open sources and conjunctive and disjunctive view definitions. For obtaining certain answers a query program is run under the cautious stable model semantics on top of a normal deductive database with choice operator that specifies the class of minimal legal instances of the integration system. This methodology works for all monotone Datalog queries. To compute answers to queries that are consistent with respect to 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 answers to any Datalog ¬ query that are consistent with respect to global universal and referential integrity constraints.
|Answer set programming, Databases, Integrity constraints, Virtual data integration|
|Journal of Applied Logic|
|Organisation||School of Computer Science|
Bravo, L. (Loreto), & Bertossi, L. (2005). Deductive databases for computing certain and consistent answers from mediated data integration systems. Journal of Applied Logic, 3(2 SPEC. ISS.), 329–367. doi:10.1016/j.jal.2004.07.023