On different structure-preserving translations to normal form

Journal of Symbolic Computation

Volumn 22, Issue 2, 1996, Pages 121-142

  Egly, Uwe ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030211060     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1996.0044     Document Type: Article

References (37)

1. Andrews, P.B. (1971). Resolution in type theory. J. Symbolic Logic, 36:414-432.
2. Andrews, P.B. (1981). Theorem proving via general matings. J. ACM, 28(2):193-214.
3. Baaz, M., Fermüller, C., Leitsch, A. (1994). A non-elementary speed up in proof length by structural clause form transformation. Proc. LICS'94, pp. 213-219. IEEE Computer Society Press Los Alamitos, California.
4. Baaz, M., Leitsch, A. (1992). Complexity of resolution proofs and function introduction. Annals of Pure and Applied Logic, 57:181-215.
5. Baaz, M., Leitsch, A. (1994). On skolemization and proof complexity. Fundamenta Informaticae, 20:353-379.
6. Bibel, W. (1993). Deduction: Automated Logic. London: Academic Press.
7. Bibel, W., Brüning, S., Egly, U., Rath, T. (1994a). Komet. In A. Bundy, (ed), Proc. Conference on Automated Deduction, pp. 783-787. Heidelberg: Springer-Verlag.
8. Bibel, W., Brüning, S., Egly, U., Rath, T. (1994b). Towards an Adequate theorem prover based on the connection method. In Proc. Sixth International Conference on Artificial Intelligence and Information-Control of Robots, pp. 137-148. World Scientific Publishing Company.
9. Boy de la Tour, T. (1992). An optimality result for clause form translation. J. Symbolic Computation, 14:283-301.
10. Bruschi, M. (1991). The halting problem. AAR Newsletter, pp. 7-12, March.
11. Burkholder, L. (1987). The halting problem. SIGACT News, 18(3):48-60.
12. Chang, C.L., Lee., R.C. (1973). Symbolic Logic and Mechanical Theorem Proving. New York: Academic Press.
13. Dafa, L. (1993). A mechanical proof of the halting problem in natural deduction style. AAR Newsletter, pp. 4-9, June.
14. Dafa, L. (1994). The formulation of the halting problem is not suitable for describing the halting problem. AAR Newsletter, pp. 1-7, October.
15. Eder, E. (1984). An implementation of a theorem prover based on the connection method. In W. Bibel and B. Petkoff, (eds), AIMSA 84, Artificial Intelligence - Methodology, Systems, Applications, Varna, Bulgaria. North-Holland Publishing Company.
16. Eder, E. (1992). Relative Complexities of First Order Calculi. Braunschweig: Vieweg.
17. Egly, U. (1994a). On Methods of Function Introduction and Related Concepts. PhD thesis, TH Darmstadt, Alexanderstr. 10, D-64283 Darmstadt.
18. Egly, U. (1994b). On the value of antiprenexing. In F. Pfenning, (ed), Proceedings of the International Conference on Logic Programming and Automated Reasoning, pp. 69-83. Berlin: Springer-Verlag.
19. Egly, U. (1996). On definitional translations to normal form for intuitionistic logic. Fundamenta Informaticae. To appear.
20. Egly, U., Rath, T. (1995). The halting problem: an automatically generated proof. AAR Newsletter, 30:10-16.
21. Egly, U., Rath, T. (1996). On the practical value of different definitional translations to normal form. In M.A. McRobbie, J.K. Slaney, (eds), Proc. Conference on Automated Deduction pp. 403-417. Berlin: Springer-Verlag.
22. Gallier, J.H. (1987). Logic for Computer Science: Foundations of Automatic Theorem Proving. New York: John Wiley & Sons.
23. Gentzen, G. (1935). Untersuchungen über das logische Schließen. Mathematische Zeitschrift, 39:176-210, 405-431. English translation in Szabo (1969).
24. Greenbaum, S., Nagasaka, A., O'Rorke, P., Plaisted, D. (1982). Comparison of natural deduction and locking resolution implementations. In D. W. Loveland, (ed), Proc. Conference on Automated Deduction, volume 138 of Lecture Notes in Computer Science, pp. 159-171. Berlin: Springer-Verlag.
25. Guha, A., Zhang, H. (1989). Andrews' challenge problem: clause conversion and solutions. AAR Newsletter, pp. 5-8, December.
26. Loveland, D.W. (1978). Automated Theorem Proving: A Logical Basis, volume 6 of Fundamental Studies in Computer Science. North-Holland, Amsterdam, New York, Oxford.
27. McCune, W. (1994). OTTER 3.0 Reference Manual and Guide. Technical Report ANL-94/6, Argonne National Laboratory, Mathematics and Computer Science Division.
28. Orevkov, V.P. (1979). Lower bounds for increasing complexity of derivations after cut elimination. Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im V.A. Steklova AN SSSR, 88:137-161. English translation in J. Soviet Mathematics, (1982) 2337-2350.
29. Orevkov, V.P. (1979). Lower bounds for increasing complexity of derivations after cut elimination. Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im V.A. Steklova AN SSSR, 88:137-161. English translation in J. Soviet Mathematics, (1982) 2337-2350.
30. Pelletier, F.J. (1986). Seventy-five problems for testing automatic theorem provers. J. Automated Reasoning, 2:191-216.
31. Plaisted, D.A., Greenbaum, S. (1986). A structure-preserving clause form translation. J. Symbolic Computation, 2:293-304.
32. Quaife, A. (1990). Andrews' challenge problem revisited. AAR Newsletter, pp. 3-7, May.
33. Statman, R. (1979). Lower Bounds on Herbrand's Theorem. In Proc. AMS 75, pp. 104-107.
34. Szabo, M.E. (ed) (1969). The Collected Papers of Gerhard Gentzen. Studies in Logic and the Foundations of Mathematics. Amsterdam: North-Holland.
35. Takeuti, G. (1975). Proof Theory, volume 81 of Studies in Logic and the Foundations of Mathematics. Amsterdam: North-Holland.
36. Tseitin, G.S. (1968). On the complexity of derivation in propositional calculus. In A. O. Slisenko, (ed), Studies in Constructive Mathematics and Mathematical Logic, Part II, pp. 234-259. Seminars in Mathematics, V.A. Steklov Mathematical Institute, vol. 8, Leningrad. English translation: Consultants Bureau, New York, 1970, pp. 115-125.
37. Tseitin, G.S. (1968). On the complexity of derivation in propositional calculus. In A. O. Slisenko, (ed), Studies in Constructive Mathematics and Mathematical Logic, Part II, pp. 234-259. Seminars in Mathematics, V.A. Steklov Mathematical Institute, vol. 8, Leningrad. English translation: Consultants Bureau, New York, 1970, pp. 115-125.