Identifying Prime Implicate Branches in Reduced Implicate Tries

Authors:
Neil V. Murray;Erik Rosenthal
Affiliations:
Department of Computer Science, State University of New York Albany, NY 12222, USA. E-mail: nvm@cs.albany.edu;Department of Mathematics, University of New Haven West Haven, CT 06516, USA. E-mail: erosenthal@newhaven.edu
Venue:
Fundamenta Informaticae - Methodologies for Intelligent Systems
Year:
2010

Citing 16
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
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
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
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The reduced implicate trie is a data structure that was introduced in [12] as a target language for knowledge compilation. It has the property that, even when large, it guarantees that a query can be processed in time linear in the size of the query, regardless of the size of the compiled knowledge base. In this paper, the branches of a reduced implicate trie that correspond to prime implicates are characterized. A technique is developed for finding and marking nodes for which all descending branches correspond to non-prime implicates. This is extended to allow the discovery of prime implicate subsets of queries with a "yes" answer.