SAT Compilation for Constraints over Finite Structured Domains


Due to the availability of powerful SAT solvers, propositional encoding is a successful technique of solving constraint systems over finite domains. As these domains are often flat and non-structured, the CO4 compiler aims to extend this concept by enriching the underlying domain with user-defined algebraic data types. Syntactically, CO4 is a subset of Haskell and allows to specify constraint systems over such enriched domains using pattern-matching, higher-order functions and polymorphism. This paper illustrates examples and use-cases for CO4 and provides an conceptual overview over the transformation into propositional logic.

Extracted Key Phrases

1 Figure or Table

Cite this paper

@inproceedings{Bau2014SATCF, title={SAT Compilation for Constraints over Finite Structured Domains}, author={Alexander Bau}, year={2014} }