文章基本信息

标题：Constraint CNF: SAT and CSP Language Under One Roof
本地全文：下载
作者：Broes De Cat ; Yuliya Lierler
期刊名称：OASIcs : OpenAccess Series in Informatics
电子版ISSN：2190-6807
出版年度：2016
卷号：52
页码：1-15
DOI：10.4230/OASIcs.ICLP.2016.12
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：Propositional Satisfiability; Constraint Programming