Prime Implicate Tries

详细信息    查看全文

• 作者：Andrew Matusiewicz ; Neil V. Murray ; Erik Rosenthal
• 刊名：Lecture Notes in Computer Science
• 出版年：2009
• 出版时间：2009
• 年：2009
• 卷：5607
• 期：1
• 页码：250-264
• 全文大小：281.9 KB

文摘

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.