Prime Implicates and Reduced Implicate Tries

Authors:
Neil V. Murray;Erik Rosenthal
Affiliations:
Department of Computer Science, State University of New York, Albany, NY, USA 12222;Department of Mathematics, University of New Haven, West Haven, USA 06516
Venue:
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Year:
2009

Citing 22
Cited 0

An algorithm to compute circumscription

Artificial Intelligence
An incremental method for generating prime implicants/implicates

Journal of Symbolic Computation
Computing prime implicants

CADE-10 Proceedings of the tenth international conference on Automated deduction
Implicit and incremental computation of primes and essential primes of Boolean functions

DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Polynomial-time algorithms for generation of prime implicants

Journal of Complexity
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric

Journal of the ACM (JACM)
Trie memory

Communications of the ACM
Decomposable negation normal form

Journal of the ACM (JACM)
CNF and DNF Considered Harmful for Computing Prime Implicants/Implicates

Journal of Automated Reasoning
A General Framework for Knowledge Compilation

PDK '91 Proceedings of the International Workshop on Processing Declarative Knowledge
Computing Prime Implicates Incrementally

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Prime Implicant Computation Using Satisfiability Algorithms

ICTAI '97 Proceedings of the 9th International Conference on Tools with Artificial Intelligence
Knowledge Compilation Using the Extension Rule

Journal of Automated Reasoning
Compilability of propositional abduction

ACM Transactions on Computational Logic (TOCL)
Efficient Query Processing with Reduced Implicate Tries

Journal of Automated Reasoning
A New Algorithm for Generating Prime Implicants

IEEE Transactions on Computers
Combining Syntax and Semantics through Prime Form Representation

Journal of Logic and Computation
Updating Reduced Implicate Tries

TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
A knowledge compilation map

Journal of Artificial Intelligence Research
A new algorithm for incremental prime implicate generation

IJCAI'93 Proceedings of the 13th international joint conference on Artifical 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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The reduced implicate trie (ri -trie) is a data structure that was introduced as a target language for knowledge compilation. It has the property that, even when large, it guarantees fast response to queries. It also has the property that each prime implicate of the formula it represents corresponds to a branch. In this paper, those prime branches are characterized, and a technique is developed for marking nodes to identify branches that correspond to non-prime implicates. This marking technique is enhanced to allow discovery of prime implicate subsets of queries that are answered affirmatively.