Document Open Access Logo

Constraint CNF: SAT and CSP Language Under One Roof

Authors Broes De Cat, Yuliya Lierler

PDF

File

Thumbnail PDF
PDF
OASIcs.ICLP.2016.12.pdf
  • Filesize: 0.5 MB
  • 15 pages

Document Identifiers

Subject Classification

Keywords
  • Propositional Satisfiability
  • Constraint Programming

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

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.

Cite As Get BibTex

Broes De Cat and Yuliya Lierler. Constraint CNF: SAT and CSP Language Under One Roof. In Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016). Open Access Series in Informatics (OASIcs), Volume 52, pp. 12:1-12:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016) https://doi.org/10.4230/OASIcs.ICLP.2016.12

Author Details

Broes De Cat
Yuliya Lierler
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact