Advanced visual modelling: beyond UML
Proceedings of the 24th International Conference on Software Engineering
SATO: An Efficient Propositional Prover
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Scheduling a Major College Basketball Conference
Operations Research
A fast pseudo-boolean constraint solver
Proceedings of the 40th annual Design Automation Conference
Solving Equations in the Relational Algebra
SIAM Journal on Computing
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Answer Set Programming Based on Propositional Satisfiability
Journal of Automated Reasoning
Combining relational algebra, SQL, constraint modelling, and local search
Theory and Practice of Logic Programming
Conditional functional dependencies for capturing data inconsistencies
ACM Transactions on Database Systems (TODS)
What is answer set programming?
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Generalizing Boolean satisfiability I: background and survey of existing work
Journal of Artificial Intelligence Research
Grounding for model expansion in k-guarded formulas with inductive definitions
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The rules of constraint modelling
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Compiling problem specifications into SAT
Artificial Intelligence - Special volume on reformulation
GrinGo: a new grounder for answer set programming
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
| Hi-index | 0.00 |
Constraint satisfaction problems (CSP) are frequently solved over data residing in relational database systems. In such scenarios, the database is typically just used as a data storage back end. However, there exist important advantages, such as the wide availability of database practices and tools for modeling, to having database systems that are capable of natively modeling and solving CSPs. This paper introduces general concepts and techniques to extend a database system with constraint processing capabilities. Input CSPs are modeled via SQL, augmented with a non-deterministic guess operator as introduced by Cadoli and Mancini (TPLP 2007). Problems are represented with a combination of internal relations and parse trees, and are translated to a flexible intermediate problem representation that is subsequently translated into several common representations for SAT. Benchmarks with a prototype system show the feasibility of the approach and demonstrate the promise of a strong integration of CSP solvers and database systems.