H. Zantema and J.C. van de Pol. A rewriting approach to binary decision diagrams. J. of Logic and Algebraic Programming, 49(1-2):61--86, 2001.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....The basic procedure is presented as a term rewrite system. This is still a highly non deterministic procedure, because a term can have more than one redex. By proving termination, we established that every strategy will yield an OBDD. However, some strategies might be more e#ective than others. In [30] rewrite strategies are studied to compute OBDDs for plain propositional logic. In particular, it is shown how the usual e#cient OBDD algorithms can be mimicked by a rewrite strategy. Already in [2] various strategies to normalize BEDs (Boolean Expression Diagrams) are described. In [16] a ....

H. Zantema and J.C. van de Pol. A rewriting approach to binary decision diagrams. J. of Logic and Algebraic Programming, 49(1-2):61--86, 2001.

....basic procedure is presented as a term rewrite system. This is still a highly non deterministic procedure, because a term can have more than one redex. By proving termination, we established that every strategy will yield an OBDD. However, some strategies might be more e#ective than others. In [30] rewrite strategies are studied to compute OBDDs for plain propositional logic. In particular, it is shown how the usual e#cient OBDD algorithms can be mimicked by a rewrite strategy. Already in [2] various strategies to normalize BEDs (Boolean Expression Diagrams) are described. In [16] a ....

H. Zantema and J.C. van de Pol. A rewriting approach to binary decision diagrams. J. of Logic and Algebraic Programming, 49(1-2):61--86, 2001.

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