Extended resolution proofs for conjoining BDDs (2006)
| Venue: | In: Proc. of the 1st Intl. Computer Science Symp. in Russia (CSR 2006). LNCS 3967 |
| Citations: | 15 - 4 self |
BibTeX
@INPROCEEDINGS{Sinz06extendedresolution,
author = {Carsten Sinz and Armin Biere},
title = {Extended resolution proofs for conjoining BDDs},
booktitle = {In: Proc. of the 1st Intl. Computer Science Symp. in Russia (CSR 2006). LNCS 3967},
year = {2006},
pages = {600--611},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We present a method to convert the construction of binary decision diagrams (BDDs) into extended resolution proofs. Besides in proof checking, proofs are fundamental to many applications and our results allow the use of BDDs instead—or in combination with—established proof generation techniques, based for instance on clause learning. We have implemented a proof generator for propositional logic formulae in conjunctive normal form, called EBDDRES. We present details of our implementation and also report on experimental results. To our knowledge this is the first step towards a practical application of extended resolution. 1
