Prime Implicate Tries

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.