ML Anthology

A New Algorithm for Computing Theory Prime Implicates Compilations

Pierre Marquis, Samira Sadaoui
AAAI 1996 pp. 504-509
/aaai/1996/marquis1996aaai-new/

Abstract

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

PDF AAAI Semantic Scholar

Cite

Text

Marquis and Sadaoui. "A New Algorithm for Computing Theory Prime Implicates Compilations." AAAI Conference on Artificial Intelligence, 1996.

Markdown

[Marquis and Sadaoui. "A New Algorithm for Computing Theory Prime Implicates Compilations." AAAI Conference on Artificial Intelligence, 1996.](https://mlanthology.org/aaai/1996/marquis1996aaai-new/)

BibTeX

@inproceedings{marquis1996aaai-new,
  title     = {{A New Algorithm for Computing Theory Prime Implicates Compilations}},
  author    = {Marquis, Pierre and Sadaoui, Samira},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {1996},
  pages     = {504-509},
  url       = {https://mlanthology.org/aaai/1996/marquis1996aaai-new/}
}