Jaco van de Pol, Hans Zantema  Home/Search
Context Related
| cwi.nl/~vdpol/papers/mfcs_bdd.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cwi.nl/~vdpol/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we propose a uniform description of basic BDD theory and algorithms by means of term rewriting. Since a BDD is a DAG instead of a tree we need a notion of shared rewriting and develop appropriate theory. A rewriting system is presented by which canonical forms can be obtained. Various reduction strategies give rise to different algorithms. A layerwise strategy is proposed having the same time complexity as the traditional apply-algorithm, and the lazy strategy is studied, which... (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):
40.2%: Binary Decision Diagrams by Shared Rewriting - Pol, Zantema (2000) (Correct)
Active bibliography (related documents): More All
0.1: Verification of Timed Automata via Satisfiability.. - Niebert, Mahfoudh.. (2002) (Correct)
0.1: Static Guard Analysis in Timed Automata Verification - Behrmann, al. (2003) (Correct)
0.1: On the Representation of Timed Polyhedra - Bournez, Maler (2000) (Correct)
Similar documents based on text: More All
0.3: JITty: a rewriter with strategy annotations - Pol (Correct)
0.2: Finding Small Equivalent Decision Trees is Hard - Zantema, Bodlaender (1999) (Correct)
0.2: Two Solutions to Incorporate Zero, Successor and Equality in.. - Badban, Pol (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/article/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/article/vandepol00binary.html" }
Citations (may not include all citations):1726 Graph-based algorithms for boolean function manipulation - Bryant - 1986
1097 Automatic verification of finitestate concurrent systems usi.. (context) - Clarke, Emerson et al. - 1986
510 Symbolic boolean manipulation with ordered binary-decision d.. - Bryant - 1992
474 Term rewriting systems - Klop - 1992
178 Symbolic model checking for sequential circuit verification - Burch, Clarke et al. - 1994
32 Boolean expression diagrams - Andersen, Hulgaard - 1997
29 Term graph rewriting - Plump - 1999
23 Algorithms and Data Structures in VLSI Design: OBDD --- Foun.. (context) - Meinel, Theobald - 1998
13 Equational binary decision diagrams - Groote, van de - 2000
8 Difference decision diagrams (context) - Mller, Lichtenberg et al. - 1999
1 Also published as CWI report SEN-R0001 (context) - Pol, Zantema et al. - 2000
Documents on the same site (http://www.cwi.nl/~vdpol/papers/): More
Modularity in Many-sorted Term Rewriting Systems - Pol (1993) (Correct)
A Bounded Retransmission Protocol for Large Data Packets. A .. - Groote, van der Pol (1993) (Correct)
Operational Semantics of Rewriting with Priorities - Pol (1997) (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