Solving SQL Constraints by Incremental Translation to SAT

Authors:
Robin Lohfert;James J. Lu;Dongfang Zhao
Affiliations:
Mathematics and Computer Science, Emory University, Atlanta, U.S.A. GA 30322-1950;Mathematics and Computer Science, Emory University, Atlanta, U.S.A. GA 30322-1950;Mathematics and Computer Science, Emory University, Atlanta, U.S.A. GA 30322-1950
Venue:
IEA/AIE '08 Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence
Year:
2008

Citing 10
Cited 1

Deductive databases—theory meets practice

EDBT '90 Proceedings of the 2nd international conference on extending database technology: Advances in Database Technology
Fundamentals of database systems (2nd ed.)

Fundamentals of database systems (2nd ed.)
Database Management Systems

Database Management Systems
Implementing the Davis–Putnam Method

Journal of Automated Reasoning
Constraint Programming and Database Query Languages

TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Guiding Real-World SAT Solving with Dynamic Hypergraph Separator Decomposition

ICTAI '04 Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence
Propositional Satisfiability and Constraint Programming: A comparative survey

ACM Computing Surveys (CSUR)
Combining relational algebra, SQL, constraint modelling, and local search

Theory and Practice of Logic Programming
CSPs: adding structure to SAT

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing

An efficient light solver for querying the semantic web

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The need to model and solve constraints over large sets of relational data occurs frequently in practice. Naively and inefficiently, solutions to the problem may be implemented in ad-hoc and difficult to maintain procedural code that accesses the data through embedded SQL programming. More elegant solutions involve the use of declarative programming languages that integrates constraint modeling with database access in transparent ways. One of the more interesting constraint languages for relational databases is the language , proposed by Cadoli and Mancini, in which SQL and its relational algebraic foundation form the basis for expressing constraints. The current paper explores the feasibility of solving finite-domain constraints via a SAT solver backend.