Abstract
Resolution based theorem proving systems require the conversion of predicate logic formulae into clausal normal form. The multiplication from disjunctive into conjunctive forms in general produces a lot of tautologous and subsumed clauses, which is relatively hard to recognize in later stages of the proof. In this paper an algorithm is presented that avoids the generation of redundant clauses. It is based on the generation of paths through a matrix and produces the set of prime implicants of the original formula.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Andrews, P. B., ‘Theorem proving via general matings’, JACM 28 (1981) 193–214.
Bibel, W., Automated Theorem Proving, Braunschweig, Vieweg, 1982.
Eisinger, N. and Weigele, M., ‘A technical note on splitting and clausal normal form algorithms’, in: Proc. 7th German Workshop on Artificial Intelligence, Dassel/Solling, Springer IFB 76, 225–231, 1983.
Gallier, J. H., Logic for Computer Science, New York, Harper and Row, 1986.
Henschen, L. et al., ‘Challenge Problem 1’ SIGART Newsletter 72 (1980) 30–31.
Lewis, H. R. and Papadimitriou, C. H., Elements of the Theory of Computation, Englewood Cliffs, NY. Prentice Hall, 1981.
Raph, Karl Mark G., ‘The Markgraph Karl refutation procedure’, interner Bericht, SEKI-Memo MK-84-01, Universität Kaiserslautern, 1984.
Loveland, D. W. and Shostak, R. E., ‘Simplifying interpreted formulas’, in: W. Bibel and R. Kowalski (Eds.): Proc. 5th Conference on Automated Deduction, Les Arcs, France. Springer LNCS 87, 97–109, 1980.
Quine, W. V. O., ‘The problem of simplifying truth functions’, American Math. Monthly, 59 (1952) 521–531.
Quine, W. V. O., ‘On cores and prime implicants of truth functions’, American Math. Monthly, 66 (1959) 755–760.
Slagle, J. R., Chang, C. L. and Lee, R. C. T., ‘A new algorithm for generating prime implicants’, IEEE Trans. on Comp. 19(4) (1970) 304–310.
Socher, R., ‘An optimized transformation into conjunctive (or disjunctive) normal form’, SEKI-Report SR-87-13, Universität Kaiserslautern, 1987.
Tison, P., ‘Generalized consensus theory and application to the minimization of boolean functions’, IEEE Trans. on Comp. 16(4) (1967) 446–456.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Socher, R. Optimizing the clausal normal form transformation. J Autom Reasoning 7, 325–336 (1991). https://doi.org/10.1007/BF00249017
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00249017