Extended resolution simulates binary decision diagrams
نویسندگان
چکیده
منابع مشابه
Resolution Simulates Polynomially Ordered Binary Decision Diagrams for Conjunctive Normal Forms
Many algorithms for satisfiability checking are based either on resolution or on Ordered Binary Decision Diagrams (OBDDs). Atserias, Kolaitis and Vardi proposed a proof system based on OBDDs. In this study we consider a restriction of their proof system corresponding to the combination of Axiom and Join rules on the one hand and resolution on the other hand. We show that resolution simulates OB...
متن کاملResolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially
There are many diierent ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution (e.g. 12] and 9]). Others use so-called binary decision diagrams (BDDs) 2, 10]. Experimental evidence suggests that BDDs and resolution based techniques are fundamentally diierent, in the sense that their performance can diier very much on benchmarks 14]. In th...
متن کاملEquational Binary Decision Diagrams Equational Binary Decision Diagrams
We incorporate equations in binary decision diagrams (BDD). The resulting objects are called EQ-BDDs. A straightforward notion of ordered EQ-BDDs (EQ-OBDD) is de ned, and it is proved that each EQ-BDD is logically equivalent to an EQ-OBDD. Moreover, on EQ-OBDDs satis ability and tautology checking can be done in constant time. Several procedures to eliminate equality from BDDs have been reporte...
متن کاملResolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially
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]). Others use so-called binary decision diagrams (BDDs) [2, 10]. Experimental evidence suggests that BDDs and resolution based techniques are fundamentally different, in the sense that their performance can differ very much on benchmarks [14]...
متن کاملCompressing Binary Decision Diagrams
The paper introduces a new technique for compressing Binary Decision Diagrams in those cases where random access is not required. Using this technique, compression and decompression can be done in linear time in the size of the BDD and compression will in many cases reduce the size of the BDD to 1-2 bits per node. Empirical results for our compression technique are presented, including comparis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2008
ISSN: 0166-218X
DOI: 10.1016/j.dam.2006.11.012