A comparative study of several proof procedures
References (21)
Tautology testing with a generalized matrix reduction method
Theoret. Comput. Sci.
(1979)On the complexity of regular resolution and the Davis-Putnam procedure
Theoret. Comput. Sci.
(1977)Refutation graphs
Artificial Intelligence
(1976)Refutations by matings
IEEE Trans. Comput.
(1976)Theorem proving via general matings
J. ACM
(1981)An approach to a systematic theorem proving procedure in first-order logic
Comput.
(1974)A syntactic connection between proof procedures and refutation procedures
On matrices with connections
J. ACM
(1981)- Bibel, A., The complete theoretical basis for the systematic proof procedure, Bericht...
There are more references available in the full text version of this article.
Cited by (16)
Consolution as a framework for comparing calculi
1993, Journal of Symbolic ComputationHigh parallelism and a proof procedure I: Theoretical considerations
1985, Decision Support SystemsA survey on computing prime implicants and implicates in classical and non-classical logics
2014, Computer Systems Science and EngineeringHerbrand's theorem, automated reasoning and semantic tableaux
1998, Proceedings - Symposium on Logic in Computer ScienceAn SE-tree-based prime implicant generation algorithm
1994, Annals of Mathematics and Artificial IntelligenceDissolution: Making Paths Vanish
1993, Journal of the ACM (JACM)
- ∗
This work was performed while the author was on leave from the Institut für Informatik, Technische Universität München, München, W. Germany. Author's present address: Institut für Informatik, Technische Universität München, Arcisstrasse, 8000 München, W. Germany.
Copyright © 1982 Published by Elsevier B.V.