Consistent query answering via ASP from different perspectives: theory and practice

DOI10.1017/S1471068411000640MaRDI QIDQ5299585zbMATH OpenOpenAlexDBLPWikidataFDO

Authors F. Ricca, G. Terracina, M. Manna

Publication date 26 June 2013

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1107.4570

zbMATH Keywords

answer set programmingconsistent query answeringdata integration

Mathematics Subject Classification ID

Logic programming (68N17)

Abstract: A data integration system provides transparent access to different data sources by suitably combining their data, and providing the user with a unified view of them, called global schema. However, source data are generally not under the control of the data integration process, thus integrated data may violate global integrity constraints even in presence of locally-consistent data sources. In this scenario, it may be anyway interesting to retrieve as much consistent information as possible. The process of answering user queries under global constraint violations is called consistent query answering (CQA). Several notions of CQA have been proposed, e.g., depending on whether integrated information is assumed to be sound, complete, exact or a variant of them. This paper provides a contribution in this setting: it uniforms solutions coming from different perspectives under a common ASP-based core, and provides query-driven optimizations designed for isolating and eliminating inefficiencies of the general approach for computing consistent answers. Moreover, the paper introduces some new theoretical results enriching existing knowledge on decidability and complexity of the considered problems. The effectiveness of the approach is evidenced by experimental results. To appear in Theory and Practice of Logic Programming (TPLP).

Recommendations

• Inconsistency Tolerance
• Logic Programming
• Taming primary key violations to query large inconsistent data via ASP
• scientific article; zbMATH DE number 2088752
• First-order under-approximations of consistent query answers

Cites work

• Advances in database technology -- EDBT 2004. 9th international conference on extending database technology, Heraklion, Crete, Greece, March 14--18, 2004. Proceedings.
• Answer sets for consistent query answering in inconsistent databases
• Experimenting with recursive queries in database and logic programming systems
• First-order query rewriting for inconsistent databases
• Magic Sets and their application to data integration
• Minimal-change integrity maintenance using tuple deletions
• The DLV system for knowledge representation and reasoning

Cited in

(11)

• Deductive databases for computing certain and consistent answers from mediated data integration systems
• Anytime computation of cautious consequences in answer set programming
• Advances in WASP
• The Design of the Sixth Answer Set Programming Competition
• Contextual data tailoring using ASP
• Cautious reasoning in ASP via minimal models and unsatisfiable cores
• Taming primary key violations to query large inconsistent data via ASP
• The External Interface for Extending WASP
• Abstract Solvers for Computing Cautious Consequences of ASP programs
• Inconsistency Tolerance
• Inconsistency-tolerant semantics based on (preferred) repairs (invited paper)

This page was built for publication: Consistent query answering via ASP from different perspectives: theory and practice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5299585)