Skip to main content
SpringerLink
Log in
Book cover

Annual Asian Computing Science Conference

ASIAN 1997: Advances in Computing Science — ASIAN'97 pp 197–211Cite as

Proof discovery in LK system by analogy

  • Session 5
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1345))

Abstract

In this paper, a schema guided model of proof discovery by analogy in theorem proving under the concept such that similar problems have similar proofs is proposed. A proof discovery system for LK inference system is formulated by considering it as a general reasoning system which is close to our thinking process. At first, a schema and a proof schema which describe the types of formulas and proofs are formulated as higher order terms. Next, the similarities of formulas and proofs are defined by means of the realizability by schemata and proof schema. Finally, a unification based procedure of discovering an LK proof for any given sequent is presented, and the implemented system is overviewed.

This work was supported in part by the Japanese Ministry of Education, Grantin-aid for scientific research(A)07308027,scientific research(C)07680405 and Inamori Foundation in 1996

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Barendregt: Introduction to Generalized Type Systems, Proc. of 3rd International Conference on Theoretical Computer Science, 1–37 (1989).

    Google Scholar 

  2. B. Brock, S. Cooper and W. Pierce: Analogical Reasoning and Proof Discovery, LNCS 310 454–468 (1988).

    Google Scholar 

  3. M. R. Donat and L. A. Wallen: Learning and Applying Generalized Solutions using Higher Order Resolution, LNCS 310, 41–60 (1988).

    Google Scholar 

  4. G. Evans: A Program for the Solution of Geometric Analogy Intelligence Test Questions, in Minsky (ed.): Semantic Information Processing, MIT Press, 271–353 (1968).

    Google Scholar 

  5. C. Feng and S. Muggleton: A Note on Least General Generalization in Higher Order Logic, Proc. of lst Workshop on Inductive Logic Programming (1992).

    Google Scholar 

  6. P. Flener: Logic Program Synthesis from Incomplete Information, Kluwer Academic Press (1995).

    Google Scholar 

  7. J. H. Gallier: Logic for Computer Science, John Wiley & Sons (1987).

    Google Scholar 

  8. N. J. Genesereth and N. J. Nilson: Logical Foundation of Artificial Intelligence, Morgan Kaufman Pub. (1987).

    Google Scholar 

  9. R. Greiner: Learning by Understanding Analogy, Proc. of lst Intern. Workshop on Analogical Reasoning (1987).

    Google Scholar 

  10. M. Haraguchi and S. Arikawa: A Formulation of Analogical Reasoning and Its Realization, J. of JSAI 1, 132–139 (1986) (in Japanese).

    Google Scholar 

  11. M. Harao: LK Theorem Proving by Analogy, Proc. of PRICAI'92, 714–720 (1992).

    Google Scholar 

  12. R. Harper, F. Honsell and G.Plotokin: A Framework for Defining Logics, Proc. of Symposium on Logic in Computer Science, 194–204 (1987).

    Google Scholar 

  13. R. W. Hasker: The Replay of Program Derivations, PhD Thesis of the University of Illinois (1995).

    Google Scholar 

  14. S. Hayasi: Mathematical logic, Corona Publisher (1989) (in Japanese).

    Google Scholar 

  15. D. H. Helman (ed.): Analogical Reasoning, Kluwer Academic Publishers (1988).

    Google Scholar 

  16. J. H. Holland, K. J. Holyoak, R. E. Nisbett and P. R. Thagard: Process of Inference, Learning, and Discovery, The MIT Press (1986).

    Google Scholar 

  17. G. P. Huet: A Unification Algorithm for Typed λ-Calculus, Theoretical Computer Science 1, 27–57 (1975).

    Article  Google Scholar 

  18. G. Huet and B. Lang: Proving and Applying Program Transformations Expressed with Second Order Patterns, Acta Informatica 11, 31–55 (1975).

    Google Scholar 

  19. K. Inoue: Principles of Abduction, J. of JSAI 7, 48–59 (1991) (in Japanese).

    Google Scholar 

  20. S. Kedar-Cabelli: Analogy from a Unified Perspective, in [15].

    Google Scholar 

  21. J. W. Lloyd: Foundations of Logic Programming, Springer Verlag (1984).

    Google Scholar 

  22. D. Miller and A. Felty: An Integration of Resolution and Natural Deduction Theorem Proving, Proc. of the AAAI'86, 198–202 (1986).

    Google Scholar 

  23. L. C. Paulson: Isabelle, LNCS 828 (1988).

    Google Scholar 

  24. F. Pfenning: Types in Logic Programming, The MIT Press (1992).

    Google Scholar 

  25. G. Polya: Induction and Analogy in Mathematics, Princeton University Press (1953).

    Google Scholar 

  26. K. R. Popper: The logic of Scientific Discovery, Basic Book Inc. (1959).

    Google Scholar 

  27. W. Snyder and J. Gallier: Higher Order Unification Revised, J. of Symbolic Computation 8, 101–140 (1989).

    Google Scholar 

  28. T. B. de la Tour and R. Caferra: Proof Analogy in Interactive Theorem Proving, Proc. IJCAI'97 95–99 (1989).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Artificial Intelligence, Kyushu Institute of Technology, 820, Iizuk, Japan

    Masateru Harao

Authors
  1. Masateru Harao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

R. K. Shyamasundar K. Ueda

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Harao, M. (1997). Proof discovery in LK system by analogy. In: Shyamasundar, R.K., Ueda, K. (eds) Advances in Computing Science — ASIAN'97. ASIAN 1997. Lecture Notes in Computer Science, vol 1345. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63875-X_53

Download citation

  • DOI: https://doi.org/10.1007/3-540-63875-X_53

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63875-9

  • Online ISBN: 978-3-540-69658-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation