Tri-Based Set Operations And Selective Computation Of Prime Implicates

ISMIS'11: Proceedings of the 19th international conference on Foundations of intelligent systems(2011)

引用 7|浏览1
暂无评分
摘要
A more efficient version of the prime implicate algorithm introduced in [12] that reduces the use of subsumption is presented. The algorithm is shown to be easily tuned to produce restricted sets of prime implicates. Experiments that illustrate these improvements are described.
更多
查看译文
关键词
Conjunctive Normal Form, Logical Formula, Empty Clause, Prime Implicants, Ternary Representation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要