Aug 15, 2003 · Experimental evidence suggests that BDDs and resolution-based techniques are fundamentally different, in the sense that their performance can differ very much ...

There are many different ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution (e.g. [12] and [9]) ...

Resolution and binary decision diagrams cannot simulate each other polynomially. Journal of Discrete Applied Mathematics. (2001). To appear. 4. Haken, A. The ...

Dive into the research topics of 'Resolution and binary decision diagrams cannot simulate each other polynomially'. Together they form a unique fingerprint ...

In this paper we confirm these findings by mathematical proof. We provide examples that are easy for BDDS and exponentially hard for any form of resolution, and ...

Dec 18, 2001 · Groote, J. F., and Zantema, H. Resolution and binary decision diagrams cannot simulate each other polynomially. Journal of Discrete Applied ...

In this paper, we confirm these findings by mathematical proof. We provide examples that are easy for BDDs and exponentially hard for any form of resolution, ...

Proving formulas in propositional logic can be done in different ways. Some of these are based on of resolution, others on binary decision diagrams (BDDs).

Resolution and binary decision diagrams cannot simulate each other polynomially.

Mar 18, 2017 · Resolution and binary decision diagrams cannot simulate each other polynomially. Discrete Applied Mathematics, 130(2):157–171, 2003. 9. J ...