A recursive paradigm to solve boolean relations

Abstract

A recursive algorithm for solving Boolean relations is presented. It provides several features: wide exploration of solutions, parametrizable cost function and efficiency. The experimental results show the applicability of the method and tangible improvements with regard to previous heuristic approaches.

DOI: 10.1145/996566.996687

Extracted Key Phrases

7 Figures and Tables

Cite this paper

@article{Baeres2004ARP, title={A recursive paradigm to solve boolean relations}, author={David Ba{\~n}eres and Jordi Cortadella and Michael Kishinevsky}, journal={Proceedings. 41st Design Automation Conference, 2004.}, year={2004}, pages={416-421} }