Constraint CNF: SAT and CSP Language Under One Roof

Authors

Broes De Cat, KU Leuven
Yuliya Lierler, University of Nebraska at OmahaFollow

Document Type

Article

Publication Date

11-11-2016

Abstract

A new language, called constraint CNF, is proposed. It integrates propositional logic with constraints stemming from constraint programming. A family of algorithms is designed to solve problems expressed in constraint CNF. These algorithms build on techniques from both propositional satisfiability and constraint programming. The result is a uniform language and an algorithmic framework, which allow us to gain a deeper understanding of the relation between the solving techniques used in propositional satisfiability and in constraint programming and apply them together.

Comments

part of: Volume: Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016) (ICLP 2016 TCs)
Series: Open Access Series in Informatics (OASIcs)
Conference: International Conference on Logic Programming (ICLP)

Recommended Citation

De Cat, Broes and Lierler, Yuliya, "Constraint CNF: SAT and CSP Language Under One Roof" (2016). Computer Science Faculty Proceedings & Presentations. 65.
https://digitalcommons.unomaha.edu/compsicfacproc/65

Creative Commons License

This work is licensed under a Creative Commons Attribution 3.0 License.