A note on the computational complexity of the pure classical implication calculus
References (2)
The complexity of theorem-proving procedures
Proc. 3rd Ann. ACM Symp. on the Theory of Computing
(1971)- et al.
The relative efficiency of propositional proof systems
J. Symbolic Logic
(1979)
Cited by (5)
Two results in negation-free logic
1993, Applied Mathematics LettersA Hybrid Approach to Solve SAT and UNSAT Problems
2020, IEEE Latin America TransactionsSome logic and related formalisms, programming paradigms, and development environments for the (new) AI
2018, 2018 41st International Convention on Information and Communication Technology, Electronics and Microelectronics, MIPRO 2018 - ProceedingsA Tutorial on Stålmarck’s proof procedure for propositional logic
2000, Formal Methods in System DesignThe complexity of minimum partial truth assignments and implication in negation-free formulae
1996, Annals of Mathematics and Artificial Intelligence
Copyright © 1989 Published by Elsevier B.V.