A new algorithm for ccomputing theory prime implicates compilations
Abstract
We present a new algorithm (called TPI/BDD) for computing the theory prime implicates compilation of a knowledge base {Sigma}. In contrast to many compilation algorithms, TPI/BDD does not require the prime implicates of {Sigma} to be generated. Since their number can easily be exponential in the size of {Sigma}, TPI/BDD can save a lot of computing. Thanks to TPI/BDD, we can now conceive of compiling knowledge bases impossible to before.
- Authors:
-
- CRIN-CNRS and INRIA-Lorraine Batiment LORIA, Vandoeuvre-les-Nancy (France)
- Publication Date:
- OSTI Identifier:
- 430701
- Report Number(s):
- CONF-960876-
TRN: 96:006521-0076
- Resource Type:
- Conference
- Resource Relation:
- Conference: 13. National conference on artifical intelligence and the 8. Innovative applications of artificial intelligence conference, Portland, OR (United States), 4-8 Aug 1996; Other Information: PBD: 1996; Related Information: Is Part Of Proceedings of the thirteenth national conference on artificial intelligence and the eighth innovative applications of artificial intelligence conference. Volume 1 and 2; PB: 1626 p.
- Country of Publication:
- United States
- Language:
- English
- Subject:
- 99 MATHEMATICS, COMPUTERS, INFORMATION SCIENCE, MANAGEMENT, LAW, MISCELLANEOUS; ARTIFICIAL INTELLIGENCE; KNOWLEDGE BASE; ALGORITHMS; MATHEMATICAL LOGIC
Citation Formats
Marquis, P, and Sadaoui, S. A new algorithm for ccomputing theory prime implicates compilations. United States: N. p., 1996.
Web.
Marquis, P, & Sadaoui, S. A new algorithm for ccomputing theory prime implicates compilations. United States.
Marquis, P, and Sadaoui, S. 1996.
"A new algorithm for ccomputing theory prime implicates compilations". United States.
@article{osti_430701,
title = {A new algorithm for ccomputing theory prime implicates compilations},
author = {Marquis, P and Sadaoui, S},
abstractNote = {We present a new algorithm (called TPI/BDD) for computing the theory prime implicates compilation of a knowledge base {Sigma}. In contrast to many compilation algorithms, TPI/BDD does not require the prime implicates of {Sigma} to be generated. Since their number can easily be exponential in the size of {Sigma}, TPI/BDD can save a lot of computing. Thanks to TPI/BDD, we can now conceive of compiling knowledge bases impossible to before.},
doi = {},
url = {https://www.osti.gov/biblio/430701},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Tue Dec 31 00:00:00 EST 1996},
month = {Tue Dec 31 00:00:00 EST 1996}
}
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.
Save to My Library
You must Sign In or Create an Account in order to save documents to your library.