License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ICLP.2016.12
URN: urn:nbn:de:0030-drops-67425
Go to the corresponding OASIcs Volume Portal

De Cat, Broes ; Lierler, Yuliya

Constraint CNF: SAT and CSP Language Under One Roof

OASIcs-ICLP-2016-12.pdf (0.5 MB)


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.

BibTeX - Entry

  author =	{Broes De Cat and Yuliya Lierler},
  title =	{{Constraint CNF: SAT and CSP Language Under One Roof}},
  booktitle =	{Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)},
  pages =	{12:1--12:15},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-007-1},
  ISSN =	{2190-6807},
  year =	{2016},
  volume =	{52},
  editor =	{Manuel Carro and Andy King and Neda Saeedloei and Marina De Vos},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-67425},
  doi =		{10.4230/OASIcs.ICLP.2016.12},
  annote =	{Keywords: Propositional Satisfiability, Constraint Programming}

Keywords: Propositional Satisfiability, Constraint Programming
Collection: Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)
Issue Date: 2016
Date of publication: 11.11.2016

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI