Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Building problem solvers
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
Decomposable negation normal form
Journal of the ACM (JACM)
A General Framework for Knowledge Compilation
PDK '91 Proceedings of the International Workshop on Processing Declarative Knowledge
Knowledge Compilation Using the Extension Rule
Journal of Automated Reasoning
A survey on knowledge compilation
AI Communications
Efficient Query Processing with Reduced Implicate Tries
Journal of Automated Reasoning
Knowledge compilation using theory prime implicates
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Efficient query processing with compiled knowledge bases
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Normal forms for knowledge compilation
ISMIS'05 Proceedings of the 15th international conference on Foundations of Intelligent Systems
| Hi-index | 0.00 |
The reduced implicate trie, introduced in [10], is a data structure that may be used as a target language for knowledge compilation. It has the property that a query can be processed in time linear in the size of the query, regardless of the size of the compiled knowledge base. This data structure can be used with propositional databases, where a query amounts to asking whether a clause is an implicate of a logical formula. In this paper, reduced implicant tries are investigated, and the dual question is addressed: determining the implicants of a formula. The main result is that a single trie -- the reduced implicate/implicant trie, with a structure that is similar to that of reduced implicate tries-- can serve dual roles, representing both implicates and implicants. As a result, there can be significant savings in both time and space.