Boolean equi-propagation for optimized SAT encoding

Amit Metodi, Michael Codish, Vitaly Lagoon, Peter J. Stuckey

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

15 Scopus citations

Abstract

We present an approach to propagation based SAT encoding, Boolean equi-propagation, where constraints are modelled as Boolean functions which propagate information about equalities between Boolean literals. This information is then applied as a form of partial evaluation to simplify constraints prior to their encoding as CNF formulae. We demonstrate for a variety of benchmarks that our approach leads to a considerable reduction in the size of CNF encodings and subsequent speed-ups in SAT solving times.

Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming, CP 2011 - 17th International Conference, Proceedings
Pages621-636
Number of pages16
DOIs
StatePublished - 26 Sep 2011
Event17th International Conference on Principles and Practice of Constraint Programming, CP 2011 - Perugia, Italy
Duration: 12 Sep 201116 Sep 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6876 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference17th International Conference on Principles and Practice of Constraint Programming, CP 2011
Country/TerritoryItaly
CityPerugia
Period12/09/1116/09/11

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Boolean equi-propagation for optimized SAT encoding'. Together they form a unique fingerprint.

Cite this