On the value of antiprenexing
Author:
- 1 January 1994
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 69-83
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- ON SKOLEMIZATION AND PROOF COMPLEXITYFundamenta Informaticae, 1994
- Complexity of resolution proofs and function introductionAnnals of Pure and Applied Logic, 1992
- Relative Complexities of First Order Calculi1992
- Automated Theorem Proving1987
- A Structure-preserving Clause Form TranslationJournal of Symbolic Computation, 1986
- Theorem Proving via General MatingsJournal of the ACM, 1981
- Lower Bounds on Herbrand's TheoremProceedings of the American Mathematical Society, 1979
- Renaming a Set of Clauses as a Horn SetJournal of the ACM, 1978
- An approach to a systematic theorem proving procedure in first-order logicComputing, 1974