Unification Algorithms for Eliminating and Introducing Quantifiers in Natural Deduction Automated Theorem Proving

Journal of Automated Reasoning

Volumn 18, Issue 1, 1997, Pages 105-134

  Li, Dafa ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Automated theorem proving; Gentzen system; Natural deduction; Unification algorithm

Indexed keywords

ARTIFICIAL INTELLIGENCE; FORMAL LOGIC; PROBLEM SOLVING; THEOREM PROVING;

GENTZEN SYSTEM; NATURAL DEDUCTION SYSTEM; UNIFICATION ALGORITHM;

ALGORITHMS;

EID: 0031076777     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1005749401809     Document Type: Article

References (36)

1. Andrews, P. B.: An Introduction to Mathematical Logic and Type Theory: To Truth through Proof, Academic Press, Orlando, FL, 1986.
2. Andrews, P. B.: Transforming mating into natural deduction proofs, in G. Goos and J. Hartmanis (eds), Proc. 5th Conference on Automated Deduction, Les Arcs, France, Lecture Notes in Computer Science 138, Springer-Verlag, Berlin, 1980.
3. Bhatta, K. S. H. S. R. and Karnick, H.: A resolution rule for well-formed formulae, Theor. Comp. Sci. 81(2) (1991), 223-235.
4. Bledsoe, W. W.: Non-resolution theorem proving, Art. Intelligence 9 (1977), 1-35.
5. Bruschi, M.: The Halting Problem, AAR Newsletter No. 17, March 1991.
6. Burckert, H.-J.: Resolution Principle for a Logic with Restricted Quantifiers, Springer-Verlag, Berlin, 1991.
7. Burkholder, L.: The Halting Problem, SIGACT News 18, No. 3 (Spring 1987), 48-60.
8. Burkholder, L.: A 76th Automated Theorem Proving Problem, AAR Newsletter 8, April 1987.
9. Cerrito, S.: Herbrand methods in sequent calculi: Unification in LL, in Proc. Joint International Conference and Symposium on Logic Programming, 1992, pp. 607-621.
10. Chang, C. L. and Lee, R. C. T.: Symbolic Logic and Mechanical Theorem Proving, Academic Press, New York, 1973.
11. Chu, H. and Plaisted, D.: Semantically guided first-order theorem proving using hyper-linking, in Proc. 12th Conference on Automated Deduction, Nancy, France, June 28-July 1, 1994.
12. De Champeaux, D.: Sub-problem finder and instance checker: Two cooperating preprocessors for theorem provers, IJCAI 6 (1979), 191-196.
13. Egly, U. and Rath, T.: The Halting Problem: An Automatically Generated Proof, AAR Newsletter No. 30, Aug. 1995.
14. Gentzen, G.: Investigations into logical deductions, in M. E. Szabo (ed.), The Collected Papers of Gerhard Gentzen, North-Holland, Amsterdam, 1969, pp. 68-131.
15. Guha, A. and Zhang, H.: Andrews' Challenge Problem: Clause Conversion and Solutions, AAR Newsletter No. 14, December 1989.
16. Lassez, J.-L., Maher, M. J. and Marriott, K.: Unification revisited, foundations of logic and functional programming, Lecture Notes in Computer Science 306 (1987), 67.
17. Li Dafa: Unification Algorithm with Quantifiers in the First-Order Logic, Science Report 89005, Dept. of Applied Mathematics of Tsinghua University, Nov. 1989.
18. Li Dafa: Unification algorithm with quantifiers and applications to automatic natural deduction, in Proc. 4th Florida Artificial Intelligence Research Symposium, 1992, pp. 196-200.
19. Li Dafa: A natural deduction automated theorem proving system, in Proc. 11th International Conference on Automated Deduction, NY, June 15-18, 1992, pp. 668-672.
20. Li Dafa: A Mechanical Proof of the Halting Problem, AAR Newsletter No. 23, June 1993.
21. Li Dafa: The Algorithms for Eliminating and Introducing Quantifiers, Science Report 93019, Dept. of Applied Mathematics of Tsinghua University, Nov. 1993.
22. Li Dafa: The algorithms for eliminating and introducing quantifiers, in Proc. PRICAI'94: The 3rd Pacific Rim International Conference on Artificial Intelligence, Beijing, Aug. 15-18, 1994, pp. 208-214.
23. Li Dafa: The Formalization of the Halting Problem is Not Suitable for Describing the Halting Problem, AAR Newsletter No. 27, October 1994.
24. Lincoln, P. D. and Shankar, N.: Proof search in first-order linear logic and other cut-free sequent calculi, in Proc. Symposium on Logic in Computer Science, 1994, pp. 282-291.
25. Manna, Z.: Mathematical Theory of Computation, McGraw-Hill, New York, 1974.
26. Martelli, A. and Montanari, U.: An efficient unification algorithm, in ACM Trans. on Programming Languages and Systems 4, No. 2 (April 1982), pp. 258-282.
27. Minsky, M. L.: Computation: Finite and Infinite Machines, Prentice-Hall, Englewood Cliffs, NJ, 1967.
28. Pasterson, M. S. and Wegman, M. N.: Linear unification, J. Comp. Sys. Sci. 16 (1978), 158-167.
29. Pastre, D.: MUSCADET: An automatic theorem proving system using knowledge and meta-knowledge in mathematics, Art. Intelligence 38 (1989), 257-318.
30. Pelletier, J.: Further Developments in THINKER, an Automated Theorem Prover: Proof Condensation, Adding Identity, 'Empirical' Issues in Computational Complexity, Pseudo-Parallel Subproof Development, Technical Report TR-ARP-16/87, Dept. of Computer Science, University of Alberta, Canada, 1987.
31. Pelletier, J.: Seventy-five problems for testing automatic theorem provers, J. Auto. Reas. 2 (1986), 191-216.
32. Robinson, J. A.: A machine-oriented logic based on the resolution principle, JACM 12(1) (1965), 23-41.
33. Sahlin, D., Franzen, T. and Haridi, S.: An Intuitionistic Predicate Logic Theorem Prover, SICS Research Report R89001, ISSN 0283-3638, Swedish Institute of Computer Science, 1989.
34. Siekmann, J. H.: Universal unification, in R. E. Shostak (ed.), 7th International Conference on Automated Deduction, Lecture Notes in Computer Science 170, Springer-Verlag, Berlin, 1984, pp. 1-42.
35. Staples, J. and Robinson, P. J.: Efficient unification of quantified terms, J. Log. Prog. 5(2) (1988), 133-149.
36. Van Vaalen, J.: An extension of unification to substitution with an application to automatic theorem proving, in 4th International Joint Conference on Artificial Intelligence, 1975, pp. 77-82.