ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Temporal databases: theory, design, and implementation
Temporal databases: theory, design, and implementation
Domain-specific languages: an annotated bibliography
ACM SIGPLAN Notices
Data mining: concepts and techniques
Data mining: concepts and techniques
ACM Transactions on Database Systems (TODS)
Alloy: a lightweight object modelling notation
ACM Transactions on Software Engineering and Methodology (TOSEM)
Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver
Proceedings of the 39th annual Design Automation Conference
Implementing the Davis–Putnam Method
Journal of Automated Reasoning
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
BANKS: browsing and keyword searching in relational databases
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
| Hi-index | 0.00 |
A two-part approach for extending relational database systems to solve boolean constraint problems is presented. The first is a SQL-extension frontend for specifying boolean constraint problems, and the second is a coupling of constraint solvers with the database engine in the backend. The language extension is high-level and domain-specific, thereby allowing users to focus on writing specifications at the abstraction level of the problem domain. Both a stand-alone solver and a stored-procedure solver are integrated in the backend, and a simple approach for finding "acceptable answers" to overly-constrained problems is discussed. A prototype system is described along with an application to scheduling tennis matches.