(Enter summary)
Abstract: BDDs provide an established technique for propositional formula manipulation. (Update)
Context of citations to this paper: More
.... technique by which for every formula # the contrived example p# (p##) can be handled e#ciently, for instance the lazy strategy as described in [17]. How do these modifications of the OBDD technique relate to resolution 1 By a careful analysis using the specific structure of...
.... by which for every formula OE the contrived example p ( p OE) can be handled efficiently, for instance the lazy strategy as described in [17]. How do these modifications of the OBDD technique relate to resolution 3. We have shown that biconditional formulas have short OBDD...
Cited by: More
Resolution and Binary Decision Diagrams Cannot Simulate Each.. - Groote, Zantema (2000)
(Correct)
Similar documents (at the sentence level):
17.7%: Binary Decision Diagrams by Shared Rewriting - Pol, Zantema (2000)
(Correct)
Active bibliography (related documents): More All
0.2: Sizes of Decision Tables and Decision Trees - Zantema, Bodlaender (1999)
(Correct)
0.2: Finding Small Equivalent Decision Trees is Hard - Zantema, Bodlaender (1999)
(Correct)
0.1: Term Graph Rewriting - Plump (1998)
(Correct)
Similar documents based on text: More All
0.4: Equational Binary Decision Diagrams - Groote, Pol (2000)
(Correct)
0.3: Binary Decision Diagrams for First Order Predicate Logic - Groote
(Correct)
0.2: State Space Reduction Using Partial τ-Confluence - Groote, al. (2000)
(Correct)
Related documents from co-citation: More All
2: GRASP---A New Search Algorithm for Satisfiability
- Silva, Sakallah - 1996
2: A machine program for theoremproving (context) - Davis, Logemann et al. - 1962
2: Hard Examples for Resolution (context) - Urquhart - 1987
BibTeX entry: (Update)
van de Pol, J. C., and Zantema, H. Binary decision diagrams by shared rewriting. Tech. Rep. UU-CS-2000-06, Utrecht University, Department of Computer Science, 2000. Available via http://www.cs.uu.nl/docs/research/publication/TechRep.html. 14 http://citeseer.ist.psu.edu/vandepol00binary.html More
@techreport{ pol00binary,
author = "J. C. van de Pol and Hans Zantema",
title = "Binary decision diagrams by shared rewriting",
number = "SEN-R0001",
month = "29,",
year = "2000",
url = "citeseer.ist.psu.edu/vandepol00binary.html" }
Citations (may not include all citations):
1726
Graph-based algorithms for boolean function manipulation
- Bryant - 1986
510
Symbolic boolean manipulation with ordered binarydecision di..
- Bryant - 1992
353
Term Rewriting and All That (context) - Baader, Nipkow - 1998
178
Symbolic model checking for sequential circuit veri cation
- Burch, Clarke et al. - 1994
109
Automatic veri cation of nite-state concurrent systems using.. (context) - Clarke, Emerson et al. - 1986
32
Boolean expression diagrams
- Andersen, Hulgaard - 1997
29
Term graph rewriting
- Plump - 1999
23
Algorithms and Data Structures in VLSI Design: OBDD | Founda.. (context) - Meinel, Theobald - 1998
9
Unlimp: Uniqueness as a leitmotiv for implementation
- Kahrs - 1992
4
Decision trees: Equivalence and propositional operations
- Zantema - 1998
2
Sizes of decision tables and decision trees
- Zantema, Bodlaender - 1999
http://www.wins.uva.nl/olivierp/aterm.html
Documents on the same site (http://www.cs.uu.nl/research/techreps/techreps.php?submit=show+reports&YEAR=&AUTH=&GRP=): More
On the Two-Level Uncapacitated Facility Location Problem - Aardal, Labbé (1995)
(Correct)
A Tourist Guide through Treewidth - Bodlaender (1993)
(Correct)
Predictive Probabilistic Models for Treatment Planning in.. - Peek (1998)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC