CNF and DNF Considered Harmful for Computing Prime Implicants/Implicates

Journal of Automated Reasoning

Volumn 18, Issue 3, 1997, Pages 337-356

  Ramesh, Anavai ^a,b   Becker, George ^b   Murray, Neil V ^b  

^a INTEL CORPORATION   (United States)

^b STATE UNIVERSITY OF NEW YORK   (United States)

Author keywords

Dissolution; Prime implicants implicates

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; ERROR CORRECTION;

CONJUNCTIVE NORMAL FORM (CNF); DISJUNCTIVE NORMAL FORM (DNF); NEGATION NORMAL FORM (NNF) FORMULA; PRIME IMPLICANTS (PI);

FORMAL LOGIC;

EID: 0031164654     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1005721905269     Document Type: Article

References (15)

1. Jackson, P. and Pais, J.: Computing prime implicants, Proceedings of the 10th International Conference on Automated Deductions, Kaiserslautern, Germany, 1990, in Lecture Notes in Artificial Intelligence, Vol. 449, Springer-Verlag, 1990, pp. 543-557.
2. Jackson, P. and Pais, J.: Computing prime implicants, Proceedings of the 10th International Conference on Automated Deductions, Kaiserslautern, Germany, 1990, in Lecture Notes in Artificial Intelligence, Vol. 449, Springer-Verlag, 1990, pp. 543-557.
3. Jackson, P.: Computing prime implicants incrementally, Proceedings of the 11th International Conference on Automated Deduction, Saratoga Springs, NY, 1992, in Lecture Notes in Artificial Intelligence, Vol. 607, Springer-Verlag, 1992, pp. 253-267.
4. Jackson, P.: Computing prime implicants incrementally, Proceedings of the 11th International Conference on Automated Deduction, Saratoga Springs, NY, 1992, in Lecture Notes in Artificial Intelligence, Vol. 607, Springer-Verlag, 1992, pp. 253-267.
5. Kean, A. and Tsiknis, G.: An incremental method for generating prime implicants/implicates, J. Symbolic Computation 9 (1990), 185-206.
6. Murray, N. V. and Rosenthal, E.: Inference with path resolution and semantic graphs, J. ACM 34(2) (1987), 225-254.
7. Murray, N. V. and Rosenthal, E.: Path dissolution: A strongly complete rule of inference, in Proceedings of the 6th National Conference on Artificial Intelligence, Seattle, WA, July 12-17, 1987, pp. 161-166.
8. Murray, N. V. and Rosenthal, E.: Reexamining intractability of analytic tableaux, in Proceedings of the 1990 International Symposium on Symbolic and Algebraic Computation, Tokyo, Japan, 1990, pp. 52-59.
9. Murray, N. V. and Rosenthal, E.: Dissolution: Making paths vanish, J. ACM 40(3) (1993), 504-535.
10. Nelson, R. J.: Simplest normal truth functions, J. Symbolic Logic 20 (1995), 105-108.
11. Plaisted, D. and Greenbaum, S.: A structure preserving clause form translation, J. Symbolic Computation 2 (1986), 293-304.
12. Przymusinski, T. C.: An algorithm to compute circumscription, Artificial Intelligence 38 (1989), 49-73.
13. Reiter, R. and de Kleer, J.: Foundations of assumption-based truth maintenance systems: preliminary report, in Proceedings of the 6th National Conference on Artificial Intelligence, Seattle, WA, 1987, pp. 183-188.
14. Slagle, J. R., Chang, C. L. and Lee, R. C. T.: A new algorithm for generating prime implicants, IEEE transactions on Computers C-19(4) (1970), 304-310.
15. Strzemecki, T.: Polynomial-time algorithm for generation of prime implicants, J. Complexity 8 (1992), 37-63.