ILP Modulo Data

The vast quantity of data generated and captured every day has led to a pressing need for tools and processes to organize, analyze and interrelate this data. Automated reasoning and optimization tools with inherent support for data could enable advancements in a variety of contexts, from data-backed decision making to data-intensive scientific research. To this end, we introduce a decidable logic aimed at database analysis. Our logic extends quantifier-free Linear Integer Arithmetic with operators from Relational Algebra, like selection and cross product. We provide a scalable decision procedure that is based on the BC(T) architecture for ILP Modulo Theories. Our decision procedure makes use of database techniques. We also experimentally evaluate our approach, and discuss potential applications.

[1]  Dan Suciu,et al.  Reverse data management , 2011, Proc. VLDB Endow..

[2]  Margus Veanes,et al.  Qex: Symbolic SQL Query Explorer , 2010, LPAR.

[3]  Tobias Achterberg,et al.  Constraint integer programming , 2007 .

[4]  E. F. CODD,et al.  A relational model of data for large shared data banks , 1970, CACM.

[5]  Christophe Lecoutre,et al.  Generalized Arc Consistency for Positive Table Constraints , 2006, CP.

[6]  Nikolaj Bjørner,et al.  Efficient E-Matching for SMT Solvers , 2007, CADE.

[7]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[8]  Gabriel M. Kuper,et al.  Constraint query languages (preliminary report) , 1990, PODS '90.

[9]  Steve Kelling,et al.  Detecting and Interpreting Variable Interactions in Observational Ornithology Data , 2009, 2009 IEEE International Conference on Data Mining Workshops.

[10]  F. E..  A Relational Model of Data Large Shared Data Banks , 2000 .

[11]  Ian P. Gent,et al.  Data Structures for Generalised Arc Consistency for Extensional Constraints , 2007, AAAI.

[12]  David Harel,et al.  Structure and complexity of relational queries , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[13]  Quoc Trung Tran,et al.  How to ConQueR why-not questions , 2010, SIGMOD Conference.

[14]  Calogero G. Zarba,et al.  Combining Decision Procedures , 2002, 10th Anniversary Colloquium of UNU/IIST.

[15]  Panagiotis Manolios,et al.  ILP Modulo Theories , 2012, CAV.

[16]  Cesare Tinelli,et al.  Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T) , 2006, JACM.

[17]  Greg Nelson,et al.  Simplification by Cooperating Decision Procedures , 1979, TOPL.

[18]  Sarfraz Khurshid,et al.  Query-Aware Test Generation Using a Relational Constraint Solver , 2008, 2008 23rd IEEE/ACM International Conference on Automated Software Engineering.

[19]  Dan Suciu,et al.  Tiresias: the database oracle for how-to queries , 2012, SIGMOD Conference.

[20]  Peter Z. Kunszt,et al.  Data Mining the SDSS SkyServer Database , 2002, WDAS.