Cited By
View all- Feuillade GHerzig ARantsoudis C(2022)Database Repair via Event-Condition-Action Rules in Dynamic LogicFoundations of Information and Knowledge Systems10.1007/978-3-031-11321-5_5(75-92)Online publication date: 10-Jul-2022
Consistent query answering with prioritized active integrity constraints
Authors: 
Marco Calautti, Luciano Caroprese, Sergio Greco, Cristian Molinaro, Irina Trubitsyna, Ester ZumpanoAuthors Info & Claims
Marco Calautti, Luciano Caroprese, Sergio Greco, Cristian Molinaro, Irina Trubitsyna, Ester ZumpanoAuthors Info & ClaimsArticle No.: 3, Pages 1 - 10
Abstract
Consistent query answering is a principled approach for querying inconsistent databases. It relies on two basic notions: the notion of a repair, that is, a consistent database that "minimally" differs from the original one, and the notion of a consistent query answer, that is, a query answer that can be derived from every repair. In general, an inconsistent database can admit multiple repairs, each corresponding to a different way of restoring consistency, and the consistent query answering framework does not make any discrimination among them. However, in many applications it is natural and desired to express preferences among the different choices that can be made to resolve inconsistency.
In this paper, we consider the framework of Prioritized Active Integrity Constraints (PAICs), a declarative and powerful form of active rules which enable users to express a wide range of integrity constraints along with preferences on how consistency should be restored. PAICs induce preferences among repairs, so that a set of "preferred" ones can be identified. Then, "preferred" query answers are naturally defined as query answers derived from preferred repairs only.
We show how preferred repairs can be obtained from the preferred stable models of a prioritized logic program derived from a given a set of PAICs. Furthermore, we study the restricted class of Prioritized Active Functional Dependencies (PAFDs), which admits a unique preferred repair and for which query answering can be accomplished in polynomial time.
References
[1]
Marcelo Arenas, Leopoldo E. Bertossi, and Jan Chomicki. 1999. Consistent Query Answers in Inconsistent Databases. In PODS. 68--79.
[2]
Marcelo Arenas, Leopoldo E. Bertossi, and Jan Chomicki. 2003. Answer sets for consistent query answering in inconsistent databases. Theory and Practice of Logic Programming 3, 4-5 (2003), 393--424.
[3]
Jean-François Baget, Michel Leclère, Marie-Laure Mugnier, and Eric Salvat. 2011. On rules with existential variables: Walking the decidability line. Artif. Intell. 175, 9-10 (2011), 1620--1654.
[4]
Leopoldo E. Bertossi. 2006. Consistent query answering in databases. SIGMOD Record 35, 2 (2006), 68--76.
[5]
Leopoldo E. Bertossi. 2011. Database Repairing and Consistent Query Answering. Morgan & Claypool Publishers.
[6]
Leopoldo E. Bertossi and Javier Pinto. 1999. Specifying Active Rules for Database Maintenance. In Proc. of the Int. Ws. on Foundations of Models and Languages for Data and Objects (FMLDO). 65--81.
[7]
Bart Bogaerts and Luís Cruz-Filipe. 2018. Fixpoint semantics for active integrity constraints. Artif. Intell. 255 (2018), 43--70.
[8]
Bart Bogaerts, Joost Vennekens, and Marc Denecker. 2015. Grounded fixpoints and their applications in knowledge representation. Artif. Intell. 224 (2015), 51--71.
[9]
Gerhard Brewka and Thomas Eiter. 1999. Preferred Answer Sets for Extended Logic Programs. Artificial Intelligence 109, 1-2 (1999), 297--356.
[10]
Marco Calautti, Sergio Greco, Cristian Molinaro, and Irina Trubitsyna. 2014. Checking Termination of Logic Programs with Function Symbols through Linear Constraints. In RuleML, Vol. 8620. 97--111.
[11]
Marco Calautti, Sergio Greco, Cristian Molinaro, and Irina Trubitsyna. 2015. Logic Program Termination Analysis Using Atom Sizes. In IJCAI. AAAI Press, 2833--2839.
[12]
Marco Calautti, Sergio Greco, Cristian Molinaro, and Irina Trubitsyna. 2016. Using linear constraints for logic program termination analysis. Theory Pract. Log. Program. 16, 3 (2016), 353--377.
[13]
Marco Calautti, Sergio Greco, Cristian Molinaro, and Irina Trubitsyna. 2020. Preference-based Inconsistency-Tolerant Query Answering under Existential Rules. In KR. to appear.
[14]
Marco Calautti, Sergio Greco, Francesca Spezzano, and Irina Trubitsyna. 2015. Checking termination of bottom-up evaluation of logic programs with function symbols. Theory Pract. Log. Program. 15, 6 (2015), 854--889.
[15]
Marco Calautti, Sergio Greco, and Irina Trubitsyna. 2013. Detecting decidable classes of finitely ground logic programs with function symbols. In 15th International Symposium on Principles and Practice of Declarative Programming, PPDP '13, Madrid, Spain, September 16-18, 2013, Ricardo Peña and Tom Schrijvers (Eds.). ACM, 239--250.
[16]
Marco Calautti, Sergio Greco, and Irina Trubitsyna. 2017. Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols. ACM Trans. Comput. Log. 18, 4 (2017), 28:1--28:42.
[17]
Luciano Caroprese, Sergio Greco, and Cristian Molinaro. 2007. Prioritized Active Integrity Constraints for Database Maintenance. In DASFAA. 459--471.
[18]
Luciano Caroprese, Sergio Greco, Cristina Sirangelo, and Ester Zumpano. 2006. Declarative Semantics of Production Rules for Integrity Maintenance. In ICLP. 26--40.
[19]
Luciano Caroprese, Sergio Greco, and Ester Zumpano. 2009. Active Integrity Constraints for Database Consistency Maintenance. IEEE Transactions on Knowledge and Data Engin. 21, 7 (2009), 1042--1058.
[20]
Luciano Caroprese, Irina Trubitsyna, Miroslaw Truszczynski, and Ester Zumpano. 2012. The View-Update Problem for Indefinite Databases. In JELIA. 134--146.
[21]
Luciano Caroprese, Irina Trubitsyna, Miroslaw Truszczynski, and Ester Zumpano. 2014. A Measure of Arbitrariness in Abductive Explanations. Theory and Practice of Logic Progr. 14, 4-5 (2014), 665--679.
[22]
Luciano Caroprese and Miroslaw Truszczynski. 2011. Active integrity constraints and revision programming. Theory and Practice of Logic Progr. 11, 6 (2011), 905--952.
[23]
Stefano Ceri, Roberta Cochrane, and Jennifer Widom. 2000. Practical Applications of Triggers and Constraints: Success and Lingering Issues (10-Year Award). In VLDB. 254--262.
[24]
Stefano Ceri, Piero Fraternali, Stefano Paraboschi, and Letizia Tanca. 1994. Automatic Generation of Production Rules for Integrity Maintenance. ACM Trans. on Database Systems 19, 3 (1994), 367--422.
[25]
Stefano Ceri and Jennifer Widom. 1990. Deriving Production Rules for Constraint Maintainance. In VLDB. 566--577.
[26]
Jan Chomicki. 2007. Consistent Query Answering: Five Easy Pieces. In ICDT. 1--17.
[27]
Jan Chomicki, Jorge Lobo, and Shamim A. Naqvi. 2003. Conflict Resolution Using Logic Programming. IEEE Transactions on Knowledge and Data Engineering 15, 1 (2003), 244--249.
[28]
Alvaro Cortés-Calabuig, Marc Denecker, Ofer Arieli, and Maurice Bruynooghe. 2006. Representation of Partial Knowledge and Query Answering in Locally Complete Databases. In LPAR. 407--421.
[29]
Luís Cruz-Filipe. 2014. Optimizing Computation of Repairs from Active Integrity Constraints. In FoIKS, Christoph Beierle and Carlo Meghini (Eds.), Vol. 8367. Springer, 361--380.
[30]
Luís Cruz-Filipe. 2016. Grounded Fixpoints and Active Integrity Constraints. In ICLP, Manuel Carro, Andy King, Neda Saeedloei, and Marina De Vos (Eds.), Vol. 52. 11:1--11:14.
[31]
Luís Cruz-Filipe, Graça Gaspar, Patrícia Engrácia, and Isabel Nunes. 2013. Computing Repairs from Active Integrity Constraints. In TASE. IEEE Computer Society, 183--190.
[32]
Bernardo Cuenca Grau, Ian Horrocks, Markus Krotzsch, Clemens Kupke, Despoina Magka, Boris Motik, and Zhe Wang. 2013. Acyclicity Notions for Existential Rules and Their Application to Query Answering in Ontologies. J. Artif. Intell. Res. 47 (2013), 741--808.
[33]
James P. Delgrande, Torsten Schaub, and Hans Tompits. 2003. A Framework for Compiling Preferences in Logic Programs. Theory and Practice of Logic Programming 3, 2 (2003), 129--187.
[34]
Alin Deutsch, Alan Nash, and Jeff B. Remmel. 2008. The Chase Revisisted. In PODS. 149--158.
[35]
Guillaume Feuillade, Andreas Herzig, and Christos Rantsoudis. 2019. A Dynamic Logic Account of Active Integrity Constraints. Fundam. Inform. 169, 3 (2019), 179--210.
[36]
Sergio Flesca, Filippo Furfaro, and Francesco Parisi. 2005. Consistent Query Answers on Numerical Databases Under Aggregate Constraints. In DBPL. 279--294.
[37]
Sergio Flesca, Filippo Furfaro, and Francesco Parisi. 2007. Preferred Database Repairs Under Aggregate Constraints. In SUM. 215--229.
[38]
Sergio Flesca, Filippo Furfaro, and Francesco Parisi. 2010. Range-Consistent Answers of Aggregate Queries under Aggregate Constraints. In SUM. 163--176.
[39]
Sergio Flesca and Sergio Greco. 2001. Declarative semantics for active rules. Theory and Practice of Logic Programming 1, 1 (2001), 43--69.
[40]
Filippo Furfaro, Sergio Greco, and Cristian Molinaro. 2007. A three-valued semantics for querying and repairing inconsistent databases. Annals of Math. and Artificial Intelligence 51, 2-4 (2007), 167--193.
[41]
Ariel Fuxman and Renée J. Miller. 2005. First-Order Query Rewriting for Inconsistent Databases. In ICDT. 337--351.
[42]
Ariel Fuxman and Renée J. Miller. 2007. First-order query rewriting for inconsistent databases. J. Comput. System Sci. 73, 4 (2007), 610--635.
[43]
Gianluigi Greco, Sergio Greco, Irina Trubitsyna, and Ester Zumpano. 2005. Optimization of bound disjunctive queries with constraints. Theory Pract. Log. Program. 5, 6 (2005), 713--745.
[44]
Gianluigi Greco, Sergio Greco, and Ester Zumpano. 2003. A Logical Framework for Querying and Repairing Inconsistent Databases. IEEE Trans. on Knowledge and Data Engin. 15, 6 (2003), 1389--1408.
[45]
Sergio Greco and Cristian Molinaro. 2007. Querying and Repairing Inconsistent Databases Under Three-Valued Semantics. In ICLP. 149--164.
[46]
Sergio Greco and Cristian Molinaro. 2008. Approximate Probabilistic Query Answering over Inconsistent Databases. In ER. 311--325.
[47]
Sergio Greco and Cristian Molinaro. 2012. Probabilistic query answering over inconsistent databases. Annals of Mathematics and Artificial Intelligence 64, 2-3 (2012), 185--207.
[48]
Sergio Greco, Cristian Molinaro, and Irina Trubitsyna. 2013. Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments. Theory Pract. Log. Program. 13, 4-5 (2013), 737--752.
[49]
Sergio Greco, Cristian Molinaro, and Irina Trubitsyna. 2018. Computing Approximate Query Answers over Inconsistent Knowledge Bases. In IJCAI, Jérôme Lang (Ed.). ijcai.org, 1838--1846.
[50]
Sergio Greco, Cristian Molinaro, Irina Trubitsyna, and Ester Zumpano. 2010. NP Datalog: A logic language for expressing search and optimization problems. Theory Pract. Log. Progr. 10, 2 (2010), 125--166.
[51]
Sergio Greco, Cristina Sirangelo, Irina Trubitsyna, and Ester Zumpano. 2003. Preferred Repairs for Inconsistent Databases. In IDEAS. 202--211.
[52]
Sergio Greco, Cristina Sirangelo, Irina Trubitsyna, and Ester Zumpano. 2004. Feasibility Conditions and Preference Criteria in Querying and Repairing Inconsistent Databases. In DEXA, Vol. 3180. 44--55.
[53]
Sergio Greco, Irina Trubitsyna, and Ester Zumpano. 2006. On the Semantics of Logic Programs with Preferences. In JELIA (Lecture Notes in Computer Science, Vol. 4160), Michael Fisher, Wiebe van der Hoek, Boris Konev, and Alexei Lisitsa (Eds.). Springer, 203--215.
[54]
Sergio Greco, Irina Trubitsyna, and Ester Zumpano. 2007. On the Semantics of Logic Programs with Preferences. Journal of Artificial Intelligence Research 30 (2007), 501--523.
[55]
Sergio Greco and Ester Zumpano. 2000. Querying Inconsistent Databases. In LPAR. 308--325.
[56]
Bruno Marnette. 2009. Generalized schema-mappings: From termination to tractability. In PODS. 13--22.
[57]
Wolfgang May and Bertram Ludascher. 2002. Understanding the global semantics of referential actions using logic rules. ACM Transactions on Database Systems 27, 4 (2002), 343--397.
[58]
Claudia Bauzer Medeiros and Márcia Jacobina Andrade. 1994. Implementing integrity control in active data bases. Journal of Systems and Software 27, 3 (1994), 171--181.
[59]
Luigi Palopoli and Riccardo Torlone. 1997. Generalized Production Rules as a Basis for Integrating Active and Deductive Databases. IEEE Transactions on Knowledge and Data Engineering 9, 6 (1997), 848--862.
[60]
Norman W. Paton and Oscar Diaz. 1999. Active Database Systems. Comput. Surveys 31, 1 (1999), 63--103.
[61]
Christos Rantsoudis, Guillaume Feuillade, and Andreas Herzig. 2017. Repairing ABoxes through Active Integrity Constraints. In DL (CEUR Workshop Proceedings, Vol. 1879), Alessandro Artale, Birte Glimm, and Roman Kontchakov (Eds.). CEUR-WS.org.
[62]
Chiaki Sakama and Katsumi Inoue. 2000. Prioritized logic programming and its application to commonsense reasoning. Artificial Intelligence 123, 1-2 (2000), 185--222.
[63]
V. S. Subrahmanian. 1994. Amalgamating Knowledge Bases. ACM Transactions Database Systems 19, 2 (1994), 291--331.
[64]
Jennifer Widom and Stefano Ceri (Eds.). 1996. Active Database Systems: Triggers and Rules For Advanced Database Processing. Morgan Kaufmann.
Index Terms
- Consistent query answering with prioritized active integrity constraints
Recommendations
On the tractability and intractability of consistent conjunctive query answering
PhD '11: Proceedings of the 2011 Joint EDBT/ICDT Ph.D. WorkshopThe consistent query answering framework has received considerable attention since it was first introduced as an alternative to coping with inconsistent databases. The framework was defined based on two notions: repairs and consistent query answers. ...
Repair localization for query answering from inconsistent databases
Query answering from inconsistent databases amounts to finding “meaningful” answers to queries posed over database instances that do not satisfy integrity constraints specified over their schema. A declarative approach to this problem relies on the ...
A dichotomy in the complexity of consistent query answering for queries with two atoms
We establish a dichotomy in the complexity of computing the consistent answers of a Boolean conjunctive query with exactly two atoms and without self-joins. Specifically, we show that the problem of computing the consistent answers of such a query ...
Comments
Information & Contributors
Information
Published In
Copyright © 2020 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 25 August 2020
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
IDEAS 2020
IDEAS 2020: 24th International Database Engineering & Applications Symposium
August 12 - 14, 2020
Seoul, Republic of Korea
Acceptance Rates
IDEAS '20 Paper Acceptance Rate 27 of 57 submissions, 47%;
Overall Acceptance Rate 74 of 210 submissions, 35%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 47Total Downloads
- Downloads (Last 12 months)4
- Downloads (Last 6 weeks)1
Reflects downloads up to 30 Aug 2024
Other Metrics
Citations
Cited By
View all- Feuillade GHerzig ARantsoudis C(2022)Database Repair via Event-Condition-Action Rules in Dynamic LogicFoundations of Information and Knowledge Systems10.1007/978-3-031-11321-5_5(75-92)Online publication date: 10-Jul-2022
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in