Abstract
In this paper, an efficient recursive algorithm is presented to compute the set of prime implicants of a propositional formula in conjunctive normal form (CNF). The propositional formula is represented as a (0,1)-matrix, and a set of 1's across its columns are termed as paths. The algorithm finds the prime implicants as the prime paths in the matrix using the divide-and-conquer technique. The algorithm is based on the principle that the prime implicant of a formula is the concatenation of the prime implicants of two of its subformulae. The set of prime paths containing a specific literal and devoid of a literal are characterized. Based on this characterization, the formula is recursively divided into subformulae to employ the divide-and-conquer paradigm. The prime paths of the subformulae are then concatenated to obtain the prime paths of the formula. In this process, the number of subsumption operations is reduced. It is also shown that the earlier algorithm based on prime paths has some avoidable computations that the proposed algorithm avoids. Besides being more efficient, the proposed algorithm has the additional advantage of being suitable for the incremental method, without recomputing prime paths for the updated formula. The subsumption operation is one of the crucial operations for any such algorithms, and it is shown that the number of subsumption operation is reduced in the proposed algorithm. Experimental results are presented to substantiate that the proposed algorithm is more efficient than the existing algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bartee, T. C., Lebow, I. L., and Reed, I. S.: Theory and Design of Digital Machines, McGraw-Hill, 1962.
Biswas, N. N.: Introduction to Logic and Switching Theory, Gordon and Breach Science, 1975.
de Kleer, J.: An assumption-based TMS, Artificial Intelligence 28 (1986), 127-162.
de Kleer, J.: Exploiting locality in a TMS, Proceedings AAAI-90, Boston, 1990, pp. 254-271.
de Kleer, J., Mackworth, A., and Reiter, R.: Characterizing diagnoses, Artificial Intelligence 56 (1992), 197-222.
de Kleer, J.: An improved incremental algorithm for generating prime implicates, Proceedings AAAI-92, 1992, pp. 780-785.
Doyle, J.: A truth maintenance system, Artificial Intelligence 12 (1979), 231-272.
Ginsberg, M. L.: A circumscriptive theorem prover, Proceedings of the Second International Workshop on Non-monotonic Reasoning, Springer, LNCS 346, 1988, pp. 100-114.
Inoue, K.: Consequence-finding based on ordered linear resolution, Proceedings IJCAI-91, 1991, pp. 158-164.
Jackson, P. and Pais, J.: Computing prime implicants, Proc. 10th International Conference on Automated Deduction, 1990, pp. 543-557.
Jackson, P.: Computing prime implicants incrementally, in D. Kapur, ed., Automated Deduction-CADE-11 Conference on Automated Deduction, Saratoga Springs, NY, LNCS 607, 1992, pp. 253-265.
Karnaugh, G.: The map method for synthesis of combinational logic circuits, AIEE Transactions on Communication and Electronics, pt. 1 72 (1953), 593-599.
Kean, A. and Tsiknis, G.: An incremental method for generating prime implicants/implicates, J. Symbolic Computation 9 (1990), 185-206.
Kohavi, Z.: Switching and Finite Automata Theory, McGraw-Hill, 1978.
Ngair, T.-H.: A new algorithm for incremental prime implicate generation, Proc. IJCAI 93, Chambrey, France, 1993. JARSDK39.tex; 5/02/1999; 11:46; v.7; p.21
Poole, D.: A logical framework for default reasoning, Artificial Intelligence 36 (1988), 27-47.
Provan, G. M.: Solving diagnostic problems using truth maintenance systems, European Conference on AI, Pitman, 1988, pp. 547-552.
Quine, W. V. O.: The problem of simplifying truth functions, American Mathematical Monthly 59 (1952), 521-531.
Quine, W. V. O.: A way to simplify truth functions, American Mathematical Monthly 62 (1955), 627-631.
Ramesh, A., Beckert, B., Hahnle, R., and Murray, N. V.: Fast subsumption checks using antilinks, J. Automated Reasoning 18 (1997), 47-83.
Reiter, R. and de Kleer, J.: Foundations of assumption-based truth maintenance systems: Preliminary report, Proc. AAAI-87, 1987, pp. 183-188.
Selman, B. and Kautz, H.: Knowledge compilation and theory approximation, J. ACM 43 (1996), 193-224.
Shiny, A. K.: TERMS: Tree-structured reason maintenance system, Ph.D. thesis, Department of Computer and Information Sciences, University of Hyderabad, 1995.
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.
Socher, R.: Optimizing the clausal normal form transformation, J. Automated Reasoning 7 (1991), 325-336.
Tison, P.: Generalization of consensus theory and application to the minimization of Boolean functions, IEEE Transactions on Electronic Computers EC-16(4) (1967), 446-456.
Tsuruta, S. and Ishizuka, M.: Efficient compiling methods of logic knowledge-base for abductive hypothesis synthesis, Technical Report, ISL-92-1, 1992.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Shiny, A.K., Pujari, A.K. An Efficient Algorithm to Generate Prime Implicants. Journal of Automated Reasoning 22, 149–170 (1999). https://doi.org/10.1023/A:1005940031099
Issue Date:
DOI: https://doi.org/10.1023/A:1005940031099