Backbones for equality

Michael Codish, Yoav Fekete, Amit Metodi

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

7 Scopus citations


This paper generalizes the notion of the backbone of a CNF formula to capture also equations between literals. Each such equation applies to remove a variable from the original formula thus simplifying the formula without changing its satisfiability, or the number of its satisfying assignments. We prove that for a formula with n variables, the generalized backbone is computed with at most n + 1 satisfiable calls and exactly one unsatisfiable call to the SAT solver. We illustrate the integration of generalized backbone computation to facilitate the encoding of finite domain constraints to SAT. In this context generalized backbones are computed for small groups of constraints and then propagated to simplify the entire constraint model. A preliminary experimental evaluation is provided.

Original languageEnglish
Title of host publicationHardware and Software
Subtitle of host publicationVerification and Testing - 9th International Haifa Verification Conference, HVC 2013, Proceedings
PublisherSpringer Verlag
Number of pages14
ISBN (Print)9783319030760
StatePublished - 1 Jan 2013
Event9th Haifa Verification Conference, HVC 2013 - Haifa, Israel
Duration: 5 Nov 20137 Nov 2013

Publication series

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


Conference9th Haifa Verification Conference, HVC 2013

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


Dive into the research topics of 'Backbones for equality'. Together they form a unique fingerprint.

Cite this