An algorithm for enumerating prime implicants
-
-
[1] University of Calabria
University of Calabria
Cosenza, Italia
-
[2] Università de Roma La Sapienza
Università de Roma La Sapienza
Roma Capitale, Italia
-
- Localización: CAEPIA'97: actas / coord. por Asociación Española de Inteligencia Artificial, Vicente J. Botti Navarro, 1997, ISBN 84-8498-765-5, págs. 297-305
- Idioma: inglés
- Texto completo no disponible (Saber más ...)
-
Resumen
A new approach for selective enumeration of prime implicants of CNF formulae is presented. The method uses a 0-1 programming schema, having feasible solutions corresponding to formula implicants. Prime implicants are generated one at a time, so that as many of them can be computed as needed by the specific application considered. Selective generation is also supported, whereby preferences on the structure of generated prime implicants can be specified. Based on this approach, an algorithm for selective enumeration of prime implicants is presented and its properties discussed. It amounts to solving the basic 0-1 programming schema first to obtain an implicant φ' (not necessarily a prime one), and then generating a prime implicant implied by φ'. Experimental results are presented which confirm the effectiveness of our approach.
