Taming primary key violations to query large inconsistent data via ASP

DOI10.1017/S1471068415000320zbMATH Open1379.68114DBLPjournals/tplp/MannaRT15arXiv1507.06103WikidataQ59215993 ScholiaQ59215993MaRDI QIDQ4593009FDOQ4593009

F. Ricca, M. Manna, G. Terracina

Publication date: 9 November 2017

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

Abstract: Consistent query answering over a database that violates primary key constraints is a classical hard problem in database research that has been traditionally dealt with logic programming. However, the applicability of existing logic-based solutions is restricted to data sets of moderate size. This paper presents a novel decomposition and pruning strategy that reduces, in polynomial time, the problem of computing the consistent answer to a conjunctive query over a database subject to primary key constraints to a collection of smaller problems of the same sort that can be solved independently. The new strategy is naturally modeled and implemented using Answer Set Programming (ASP). An experiment run on benchmarks from the database world prove the effectiveness and efficiency of our ASP-based approach also on large data sets. To appear in Theory and Practice of Logic Programming (TPLP), Proceedings of ICLP 2015.

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

Recommendations

• Answer sets for consistent query answering in inconsistent databases
• Publication:2767028
• Consistent query answering via ASP from different perspectives: theory and practice
• Database Theory - ICDT 2005
• First-order query rewriting for inconsistent databases

zbMATH Keywords

inconsistent databasesconsistent query answeringASP

Mathematics Subject Classification ID

Logic programming (68N17) Database theory (68P15)

Cites Work

• Title not available (Why is that?)
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Title not available (Why is that?)
• Minimal-change integrity maintenance using tuple deletions
• Answer sets for consistent query answering in inconsistent databases
• A dichotomy in the complexity of consistent query answering for queries with two atoms
• First-order query rewriting for inconsistent databases
• Logic Programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Anytime Computation of Cautious Consequences in Answer Set Programming
• Consistent query answering via ASP from different perspectives: Theory and practice

Cited In (8)

• Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper)
• A Logic-Based Framework Leveraging Neural Networks for Studying the Evolution of Neurological Disorders
• Partial Compilation of ASP Programs
• ASP and subset minimality: enumeration, cautious reasoning and MUSes
• Paracoherent answer set computation
• Consistent query answering for primary keys in Datalog
• Cautious reasoning in ASP via minimal models and unsatisfiable cores
• The External Interface for Extending WASP

Uses Software

• Gringo

This page was built for publication: Taming primary key violations to query large inconsistent data via ASP

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