TY  - JOUR
AU  - Herlihy, B
AU  - Schachte, P
AU  - Sondergaard, H
Y2  - 2014/05/21
Y1  - 2007/04/01
SN  - 0129-0541
UR  - http://hdl.handle.net/11343/29293
AB  - We present a new method for finding closed forms of recursive Boolean function definitions. Traditionally, these closed forms are found by Kleene iteration: iterative approximation until a fixed point is reached. Conceptually, our new method replaces each k-ary function by 2k Boolean constants defined by mutual recursion. The introduction of an exponential number of constants is mitigated by the simplicity of their definitions and by the use of a novel variant of ROBDDs to avoid repeated computation. Experiments suggest that this approach is significantly faster than Kleene iteration for examples that require many Kleene iteration steps.
LA  - English
PB  - WORLD SCIENTIFIC PUBL CO PTE LTD
KW  - Artificial Intelligence and Image Processing
T1  - Un-kleene boolean equation solving
DO  - 10.1142/S0129054107004668
IS  - International Journal of Foundations of Computer Science
VL  - 18
IS  - 2
SP  - 227-250
L1  - /bitstream/handle/11343/29293/278001_79199.pdf?sequence=1&isAllowed=n
ER  -