CADE-10 Proceedings of the tenth international conference on Automated deduction
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Building problem solvers
A kind of logical compilation for knowledge bases
Theoretical Computer Science
A New Algorithm for Generating Prime Implicants
IEEE Transactions on Computers
A new algorithm for incremental prime implicate generation
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Knowledge compilation using theory prime implicates
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
A logically complete reasoning maintenance system based on a logical constraint solver
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Compilation for critically constrained knowledge bases
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Attacking the Complexity of Prioritized Inference Preliminary Report
SBIA '02 Proceedings of the 16th Brazilian Symposium on Artificial Intelligence: Advances in Artificial Intelligence
A survey on knowledge compilation
AI Communications
Weighted Description Logics Preference Formulas for Multiattribute Negotiation
SUM '09 Proceedings of the 3rd International Conference on Scalable Uncertainty Management
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Knowledge compilation with empowerment
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Complexity issues related to propagation completeness
Artificial Intelligence
| Hi-index | 0.00 |
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.