Readings in nonmonotonic reasoning
A circumscriptive theorem prover
Proceedings of the 2nd international workshop on Non-monotonic reasoning
An incremental method for generating prime implicants/implicates
Journal of Symbolic Computation
Building problem solvers
Scaling up logic-based truth maintenance systems via fact garbage collection
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Tri-based set operations and selective computation of prime implicates
ISMIS'11 Proceedings of the 19th international conference on Foundations of intelligent systems
Efficient query processing with compiled knowledge bases
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
On subsumption removal and on-the-fly CNF simplification
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
An approach to abductive reasoning in equational logic
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
Prime implicates have become a widely used tool in AI. The prime implicates of a set of clauses can be computed by repeatedly resolving pairs of clauses, adding the resulting resolvents to the set and removing subsumed clauses. Unfortunately, this brute-force approach performs far more resolution steps than necessary. Tison provided a method to avoid many of the resolution steps and Kean and Tsiknis developed an optimized incremental version. Unfortunately, both these algorithms focus only on reducing the number of resolution steps required to compute the prime implicates. The actual running time of the algorithms depends critically on the number and expense of the subsumption checks they require. This paper describes a method based on a simplification of Kean and Tsiknis' algorithm using an entirely different data structure to represent the data base of clauses. The new algorithm uses it form of discrimination net called tries to represent the clausal data base which produces an improvement in running time on all known examples with a dramatic improvement in running time on larger examples.