CAvSAT: Answering Aggregation Queries over Inconsistent Databases via SAT Solving

Dixit, Akhil A.; Kolaitis, Phokion G.

doi:10.1145/3448016.3452749

Cited by 4 publications

(3 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The propositional satisfiability problem (SAT) is the problem of determining whether a CNF formula admits a model or not. At present, this widely studied NP-Complete problem has been successfully applied in various practical settings, including data mining [Raedt et al, 2008;Guns et al, 2017], overlapping community detection [Jabbour et al, 2018b;, and more recently queries answering over databases [Dixit, 2019;Bienvenu and Bourgaux, 2022].…”

Section: Propositional Logic and Satisfiability Problemmentioning

confidence: 99%

A Symbolic Approach to Computing Disjunctive Association Rules from Data

Jabbour

Raddaoui

Saïs

2023

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence

View full text Add to dashboard Cite

Association rule mining is one of the well-studied and most important knowledge discovery task in data mining. In this paper, we first introduce the k-disjunctive support based itemset, a generalization of the traditional model of itemset by allowing the absence of up to k items in each transaction matching the itemset. Then, to discover more expressive rules from data, we define the concept of (k, k′)-disjunctive support based association rules by considering the antecedent and the consequent of the rule as k-disjunctive and k′-disjunctive support based itemsets, respectively. Second, we provide a polynomial-time reduction of both the problems of mining k-disjunctive support based itemsets and (k, k′)-disjunctive support based association rules to the propositional satisfiability model enumeration task. Finally, we show through an extensive campaign of experiments on several popular real-life datasets the efficiency of our proposed approach

show abstract

Section: Propositional Logic and Satisfiability Problemmentioning

confidence: 99%

A Symbolic Approach to Computing Disjunctive Association Rules from Data

Jabbour

Raddaoui

Saïs

2023

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence

View full text Add to dashboard Cite

show abstract

“…CQA is also studied under different notions of repairs like operational repairs [10,12] and preferred repairs [48,29]. CQA has also been studied for queries with aggregation, in both theory and practice [16,28].…”

Section: Related Workmentioning

confidence: 99%

Consistent Query Answering for Primary Keys on Path Queries

Koutris

Ouyang

Wijsen

2021

Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems

View full text Add to dashboard Cite

We study the data complexity of consistent query answering (CQA) on databases that may violate the primary key constraints. A repair is a maximal subset of the database satisfying the primary key constraints. For a Boolean query q, the problem CERTAINTY(q) takes a database as input, and asks whether or not each repair satisfies q. The computational complexity of CERTAINTY(q) has been established whenever q is a selfjoin-free Boolean conjunctive query, or a (not necessarily self-join-free) Boolean path query. In this paper, we take one more step towards a general classification for all Boolean conjunctive queries by considering the class of rooted tree queries. In particular, we show that for every rooted tree query q, CERTAINTY(q) is in FO, NL-hard ∩ LFP, or coNP-complete, and it is decidable (in polynomial time), given q, which of the three cases applies. We also extend our classification to larger classes of queries with simple primary keys. Our classification criteria rely on query homomorphisms and our polynomial-time fixpoint algorithm is based on a novel use of context-free grammar (CFG).

show abstract

“…The CAvSAT system is implemented in Java 9.04 and its code is opensourced at a GitHub repository https://github.com/uccross/cavsat via a BSD-style license. Various features of CAvSAT, including its graphical user interface, will be presented in a short paper to appear in the demonstration track of the 2021 SIGMOD conference [16].…”

Section: Experimental Evaluationmentioning

confidence: 99%

Consistent Answers of Aggregation Queries using SAT Solvers

Dixit¹,

Kolaitis²

2021

Preprint

Self Cite

View full text Add to dashboard Cite

The framework of database repairs and consistent answers to queries is a principled approach to managing inconsistent databases. We describe the first system able to compute the consistent answers of general aggregation queries with the COUNT(𝐴), COUNT(*), and SUM operators, and with or without grouping constructs. Our system uses reductions to optimization versions of Boolean satisfiability (SAT) and then leverages powerful SAT solvers. We carry out an extensive set of experiments on both synthetic and real-world data that demonstrate the usefulness and scalability of this approach.

show abstract

CAvSAT: Answering Aggregation Queries over Inconsistent Databases via SAT Solving

Cited by 4 publications

References 16 publications

A Symbolic Approach to Computing Disjunctive Association Rules from Data

A Symbolic Approach to Computing Disjunctive Association Rules from Data

Consistent Query Answering for Primary Keys on Path Queries

Consistent Answers of Aggregation Queries using SAT Solvers

Contact Info

Product

Resources

About