A New Algorithm for Computing Theory Prime Implicates Compilations

We present a new algorithm (called TPI /BDD) for computing the theory prime implicates compilation of a knowledge base X. In contrast to many compilation algorithms, TPI /BDD does not require the prime implicates of Z to be generated. Since their number can easily be exponential in the size of X, TPI/BDD can save a lot of computing. Thanks to TPI/BDD, we can now conceive of compiling knowledge bases impossible to before.

Authors

• Pierre Marquis Univ. Artois, CNRS, CRIL, Lens, France Institut Universitaire de France

Keywords

No keywords are indexed for this paper.