87 Hits in 4.1 sec

Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations [article]

Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Živný
2022 arXiv   pre-print
We establish an exhaustive classification into tractable and intractable cases if φ is a conjunctive query with disequalities and negations: ∙ If there is a constant bound on the arity of φ, and if the  ...  conjunctive queries with bounded hypertreewidth due to Arenas, Croquevielle, Jayaram and Riveros (STOC 2021).  ...  Unbounded Arity Figure 1 : Overview of our results on approximately counting answers to conjunctive queries (CQs), to conjunctive queries with disequalities (DCQs), and to conjunctive queries with disequalities  ... 
arXiv:2103.12468v2 fatcat:qlf52fkbnvcatnhasbvbhyhj3e

Boolean Tensor Decomposition for Conjunctive Queries with Negation [article]

Mahmoud Abo Khamis, Hung Q. Ngo, Dan Olteanu, Dan Suciu
2019 arXiv   pre-print
We propose an algorithm for answering conjunctive queries with negation, where the negated relations have bounded degree.  ...  We show how to rewrite queries with negation on bounded-degree relations into equivalent conjunctive queries with not-all-equal (NAE) predicates, which are a multi-dimensional analog of disequality (not-equal  ...  The color-coding technique [9] underlies existing approaches to answering queries with disequalities [11, 26, 37], the homomorphic embedding problem [18], and mo- tif finding and counting in computational  ... 
arXiv:1712.07445v5 fatcat:j7zth5dztnfmllt4w3dss5mqom

Constraint-Based Model Checking of Data-Independent Systems [chapter]

Beata Sarna-Starosta, C. R. Ramakrishnan
2003 Lecture Notes in Computer Science  
We have implemented our technique using logic programming with tabulation and constraints. We also describe an extension to the automata model that permits verification of a richer class of systems.  ...  Our technique introduces a unified, automata-based model for infinite-state systems and LTL formulas.  ...  A classic approach to deal with problems due to counts is to approximate the counts: for instance, a widely-used approach is to maintain counts using the finite domain {0, 1, many}.  ... 
doi:10.1007/978-3-540-39893-6_33 fatcat:qhdlrgq6bbfptesb7uba52rupe

Coping with Incomplete Data: Recent Advances

Marco Console, Paolo Guagliardo, Leonid Libkin, Etienne Toussaint
2020 Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems  
Work on the semantics of SQL was in conjunction with our collaboration with Neo4j Inc, supported by a grant from them.  ...  Finally, the third author is grateful to Foundation Sciences Mathématiques de Paris for supporting his stay in Paris in the Fall of 2019, during which some of this work was done.  ...  nulls, and with equality and disequality being the only available predicates.  ... 
doi:10.1145/3375395.3387970 dblp:conf/pods/ConsoleGLT20 fatcat:j62xnjuxfbfx7bskzmf6hcg27a

Tractable Lineages on Treelike Instances

Antoine Amarilli, Pierre Bourhis, Pierre Senellart
2016 Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - PODS '16  
By contrast, we can strengthen the previous dichotomy to lineages, and show that there are even UCQs with disequalities that have superpolynomial OBDDs on all unbounded-treewidth graph classes; we give  ...  This dichotomy relies on recent polynomial bounds on the extraction of planar graphs as minors, and implies lower bounds in non-probabilistic settings, for query evaluation and match counting in subinstance-closed  ...  We also thank the anonymous reviewers of PODS 2016 for their valuable comments, in particular for strengthening Theorem 9.7 to tree-depth.  ... 
doi:10.1145/2902251.2902301 dblp:conf/pods/AmarilliBS16 fatcat:skanmavk2vfrfgop3wqq3ebpoe

Probabilistic Databases

Dan Suciu, Dan Olteanu, Christopher Ré, Christoph Koch
2011 Synthesis Lectures on Data Management  
Acknowledgments The authors would like to acknowledge many collaborators and friends who, through their discussions and comments have helped shape our thinking and, thus, have directly or indirectly  ...  Gal et al. [2009] study how to answer aggregate queries with COUNT, AVG, SUM, MIN, and MAX over such mappings, by considering both by-table and bytuple semantics.  ...  Olteanu and Huang [2008] and describe efficient compilation techniques into OBDDs and FBDDs for conjunctive queries extended with disequalities ( =) and inequalities (<), respectively, and study which  ... 
doi:10.2200/s00362ed1v01y201105dtm016 fatcat:2bpr73ml4ffkhmnj37mjbmwgsu

On Functional Aggregate Queries with Additive Inequalities

Mahmoud Abo Khamis, Ryan R. Curtin, Benjamin Moseley, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich
2019 Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - PODS '19  
We refer to these queries as FAQ-AI for short. To answer FAQ-AI in the Boolean semiring, we define relaxed tree decompositions and relaxed submodular and fractional hypertree width parameters.  ...  Any FAQ and FAQ-AI over one semiring can be answered in time proportional to #subw and respectively to the relaxed version of #subw.  ...  We use relaxed TDs in conjunction with Lemma 3.1 to answer FAQ-AI with a relaxed notion of faqw.  ... 
doi:10.1145/3294052.3319694 dblp:conf/pods/KhamisCM0NOS19 fatcat:s7tc4vukfnf4xfzz2ilrptbupm

Applying Constraint Logic Programming to SQL Semantic Analysis

2019 Theory and Practice of Logic Programming  
with respect to other approaches, as well as some performance data.  ...  in such queries.  ...  Related Work There are many tools targeted at learning SQL focusing on the answers of queries with respect to database instances, i.e., comparing the output of queries with the output of reference queries  ... 
doi:10.1017/s1471068419000206 fatcat:jwjr7bqscfcgdjmzg2p5kxsa6u

Beyond the Elementary Representations of Program Invariants over Algebraic Data Types [article]

Yurii Kostyukov, Dmitry Mordvinov, Grigory Fedyukovich
2021 arXiv   pre-print
In this paper, we explore three different approaches to represent program invariants of ADT-manipulating programs: tree automata, and first-order formulas with or without size constraints.  ...  The implementation called RInGen has been evaluated against state-of-the-art invariant synthesizers and has been experimentally shown to be competitive.  ...  By extending it with some odd number ∪ { 2 +1 ( )} ⊆ ′ , we violate the query clause with = 2 ( ) and = 2 +1 ( ).  ... 
arXiv:2104.04463v2 fatcat:nbk34cumzvg7xfemtfn4u6cole

Combining answer set programming with description logics for the Semantic Web

Thomas Eiter, Giovambattista Ianni, Thomas Lukasiewicz, Roman Schindlauer, Hans Tompits
2008 Artificial Intelligence  
Such rules are similar to usual rules in nonmonotonic logic programs, but they may also contain queries to L, possibly under default negation, in their bodies.  ...  For arbitrary dl-programs, we define answer sets by generalizing Gelfond and Lifschitz's notion of a transform, leading to a strong and a weak answer set semantics, which are based on reductions to the  ...  We also thank the reviewers of this paper and its KR 2004 preliminary version, whose constructive comments helped to improve our work, and to Minh Tran Dao for help in proof reading.  ... 
doi:10.1016/j.artint.2008.04.002 fatcat:6ljwvnzkkrec3martvmac4cdua

Functional Aggregate Queries with Additive Inequalities [article]

Mahmoud Abo Khamis, Ryan R. Curtin, Benjamin Moseley, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich
2020 arXiv   pre-print
We refer to these queries as FAQ-AI for short. To answer FAQ-AI in the Boolean semiring, we define relaxed tree decompositions and relaxed submodular and fractional hypertree width parameters.  ...  Any FAQ and FAQ-AI over one semiring can be answered in time proportional to #subw and respectively to the relaxed version of #subw.  ...  LN gratefully acknowledges support from NSF grants CAREER DMS-1351362 and CNS-1409303, Adobe Research and Toyota Research, and a Margaret and Herman Sokol Faculty Award.  ... 
arXiv:1812.09526v4 fatcat:st7lfp7hufagdkcybhrgold5ey

A Little More Conversation, a Little Less Action, a Lot More Satisfaction: Global States in ProVerif

Vincent Cheval, Veronique Cortier, Mathieu Turuani
2018 2018 IEEE 31st Computer Security Foundations Symposium (CSF)  
Our key idea is to devise a generic transformation of the security properties queried to ProVerif. We prove the soundness of our transformation and implement it into a front-end GSVerif.  ...  Our experiments show that our front-end (combined with ProVerif) outperforms the few existing tools, both in terms of efficiency and protocol coverage.  ...  We are also grateful to Bruno Blanchet for his advices and comments when modifying ProVerif.  ... 
doi:10.1109/csf.2018.00032 dblp:conf/csfw/ChevalCT18 fatcat:eccp3aawyvcpnnub347c6vjnqa

Decidability bounds for Presburger arithmetic extended by sine [article]

Eion Blanchard, Philipp Hieronymi
2022 arXiv   pre-print
We consider Presburger arithmetic extended by the sine function, call this extension sine-Presburger arithmetic (sin-PA), and systematically study decision problems for sets of sentences in sin-PA.  ...  To do so, we explicitly interpret the weak monadic second-order theory of the grid, which is undecidable, in sin-PA.  ...  Let Φ(x) be a conjunction of L sin -inequalities, L-equalities and -disequalities, and divisibility predicates.  ... 
arXiv:2204.00099v2 fatcat:tuhtb4y3afcithbmlfviabkpte

What you always wanted to know about Datalog (and never dared to ask)

S. Ceri, G. Gottlob, L. Tanca
1989 IEEE Transactions on Knowledge and Data Engineering  
The aim of this paper is to provide a survey of research performed on Datalog, also addressed to those members of the database community who are not too familiar with logic programming concepts.  ...  We present the syntax and semantics of Datalog and its use for querying a relational database.  ...  Semantic optimization, instead, concerns the use of additional semantic knowledge about the database in order X P ' , G . to produce an efficient answer to a query; the combination of the query with additional  ... 
doi:10.1109/69.43410 fatcat:zeplr335mvhttigtpm73tkniiy

Complexity and expressive power of logic programming

Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov
2001 ACM Computing Surveys  
These include logic programming with different forms of negation, disjunctive logic programming, logic programming with equality, and constraint logic programming.  ...  The main focus is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention general logic programming with function symbols.  ...  Acknowledgments We would like to thank Jan van den Bussche, Michael Gelfond, Leonid Libkin, Domenico Saccá, Moshe Vardi, and our colleagues for comments on a previous version of this paper and suggestions  ... 
doi:10.1145/502807.502810 fatcat:534rdwm6fbdmtn6ghdsntvca5e
« Previous Showing results 1 — 15 out of 87 results