A new algorithm for ccomputing theory prime implicates compilations
Conference
·
OSTI ID:430701
- CRIN-CNRS and INRIA-Lorraine Batiment LORIA, Vandoeuvre-les-Nancy (France)
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.
- OSTI ID:
- 430701
- Report Number(s):
- CONF-960876-; TRN: 96:006521-0076
- 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
Similar Records
Approximate knowledge compilation: The first order case
New Advanced Source Identification Algorithm (ASIA-NEW) for radiation monitors with plastic detectors
Real breakthrough in detection of radioactive sources by portal monitors with plastic detectors and New Advanced Source Identification Algorithm (ASIA-New)
Conference
·
Tue Dec 31 00:00:00 EST 1996
·
OSTI ID:430701
New Advanced Source Identification Algorithm (ASIA-NEW) for radiation monitors with plastic detectors
Conference
·
Wed Jul 01 00:00:00 EDT 2015
·
OSTI ID:430701
Real breakthrough in detection of radioactive sources by portal monitors with plastic detectors and New Advanced Source Identification Algorithm (ASIA-New)
Conference
·
Wed Jul 01 00:00:00 EDT 2015
·
OSTI ID:430701