Boolean equation solving as graph traversal

We present a new method for finding closed forms of recursive Boolean function definitions. Traditionally, these closed forms are found by iteratively approximating until a fixed point is reached. Conceptually, our new method replaces each k-ary function by 2k Boolean variables defined by mutual recursion.

• Type: Conference
• Year: 2006
• Where: CATS
• Authors: Brian Herlihy, Peter Schachte, Harald Søndergaard
• Keywords: Boolean Variables, CATS 2006, CATS 2007, Closed Forms, Recursive Boolean Function