2026-07-22T22:17:53Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6742 2024-03-06T10:29:57Z ddc:004 open_access

Constraint CNF: SAT and CSP Language Under One Roof De Cat, Broes Lierler, Yuliya Propositional Satisfiability Constraint Programming 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Broes De Cat and Yuliya Lierler 2016 Is Part Of OASIcs, Volume 52, Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ICLP.2016.12 urn:nbn:de:0030-drops-67425 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2016.12 eng https://creativecommons.org/licenses/by/3.0/legalcode