Prime Implicate Tries

Authors:
Andrew Matusiewicz;Neil V. Murray;Erik Rosenthal
Affiliations:
Institute for Informatics, Logics, & Security Studies, Department of Computer Science, University at Albany --- SUNY, Albany, USA NY 12222;Institute for Informatics, Logics, & Security Studies, Department of Computer Science, University at Albany --- SUNY, Albany, USA NY 12222;Department of Mathematics, University of New Haven, West Haven, USA CT 06516
Venue:
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Year:
2009

Citing 15
Cited 3

An algorithm to compute circumscription

Artificial Intelligence
An incremental method for generating prime implicants/implicates

Journal of Symbolic Computation
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)
CNF and DNF Considered Harmful for Computing Prime Implicants/Implicates

Journal of Automated Reasoning
Computing Prime Implicants

Proceedings of the 10th International Conference on Automated Deduction
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
Updating Reduced Implicate Tries

TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
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

An alternative polychronous model and synthesis methodology for model-driven embedded software

Proceedings of the 2010 Asia and South Pacific Design Automation Conference
Tri-based set operations and selective computation of prime implicates

ISMIS'11 Proceedings of the 19th international conference on Foundations of intelligent systems
An approach to abductive reasoning in equational logic

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

The prime implicate trie (pi -trie) of a logical formula is a tree whose branches are labeled with the prime implicates of the formula. The technology of reduced implicate tries is employed to analyze the structure of pi -tries. Appropriate lemmas and theorems are proved, and an algorithm that builds the pi -trie from a logical formula is developed. Preliminary experimental results are presented.