@inproceedings{97284ffcc2e74b2c81e3c0394135b93d,

title = "Backbones for equality",

abstract = "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.",

author = "Michael Codish and Yoav Fekete and Amit Metodi",

year = "2013",

month = jan,

day = "1",

doi = "10.1007/978-3-319-03077-7_1",

language = "English",

isbn = "9783319030760",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "1--14",

booktitle = "Hardware and Software",

address = "Germany",

note = "9th Haifa Verification Conference, HVC 2013 ; Conference date: 05-11-2013 Through 07-11-2013",

}