A Case Study in Engineering SQL Constraint Database Systems (Extended Abstract)

Practical contexts for constraint satisfaction problems (CSP) often involve large relational databases. The recent proposal by Cadoli and Mancini, CONSQL, shows that a simple extension to SQL provides a viable basis for modeling CSP [1]. This enables the transparent integration of CSP solvers with databases using SQL --- the most widely known and popular database language, and opens the possibility for making the power of CSP technology accessible to SQL knowledgeable users.

[1]  Carlo Zaniolo,et al.  The LDL System Prototype , 1990, IEEE Trans. Knowl. Data Eng..

[2]  Yuliya Lierler,et al.  Answer Set Programming Based on Propositional Satisfiability , 2006, Journal of Automated Reasoning.

[3]  Marco Cadoli,et al.  : Compiling problem specifications into SAT , 2005, Artif. Intell..

[4]  P. Harker,et al.  Scheduling a Major College Basketball Conference , 1998 .

[5]  Dina Q. Goldin,et al.  Constraint Programming and Database Query Languages , 1994, TACS.

[6]  Michael J. Maher,et al.  Constraint Logic Programming: A Survey , 1994, J. Log. Program..

[7]  Toni Mancini,et al.  Combining relational algebra, SQL, constraint modelling, and local search* , 2006, Theory and Practice of Logic Programming.

[8]  Carlo Zaniolo,et al.  Deductive Databases - Theory Meets Practice , 1990, EDBT.

[9]  Benjamin C. Pierce,et al.  Theoretical Aspects of Computer Software , 2001, Lecture Notes in Computer Science.

[10]  Hantao Zhang.  Generating College Conference Basketball Schedules by a SAT Solver , 2003 .

[11]  Dennis Tsichritzis,et al.  Advances in Database Technology — EDBT '90 , 1990, Lecture Notes in Computer Science.