Skip to main content
SpringerLink
Log in

Automated natural deduction prover and experiments

  • Contributed Papers
  • Conference paper
  • First Online:
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 1997)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1227))

  • 170 Accesses

Abstract

The paper presents the heuristics and techniques which are used to implement automated natural deduction prover (ANDP), the natural deduction was adapted from Gentzen system. There are 4 rules for quantifiers in Gentzen system and we have two unification algorithms in the system ANDP to handle quantifiers. Andrews' Challenge and Turing Halting Problem were solved using ANDP.

The project supported by NSFC, partially by Intelligence Technology and System Lab.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bruschi, M., The Halting Problem, AAR Newsletter 17, March 1991.

    Google Scholar 

  2. Li Dafa, A Natural Deduction Automated Theorem Proving System, Proc. of CADE-11: 11th international Conference On Automated Deduction, June 15–18, 1992, NY, USA, P668–672.

    Google Scholar 

  3. Li Dafa, A Mechanical Proof of the Halting Problem, AAR Newsletter, No.23, June 1993.

    Google Scholar 

  4. Li Dafa, The Formalization of the Halting Problem Is Not Suitable for Describing the Halting Problem, AAR Newsletter 27, October 1994.

    Google Scholar 

  5. Li Dafa, The Algorithms For Eliminating and Introducing Quantifiers, Proc. of PRICAI'94: The 3rd Pacific Rim International Conference On Artificial Intelligence, Aug. 15–18, 1994, Beijing, P208–214.

    Google Scholar 

  6. Li Dafa, An Automated Natural Deduction Proof of the Formalization of the Halting Problem, AAR NEWSLetter, No. 32, March 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Applied Mathematics, Tsinghua University, 100084, Beijing, China

    Li Dafa

  2. Dept. of Computer Science, Tsinghua University, China

    Jia Peifa

Authors
  1. Li Dafa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jia Peifa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Didier Galmiche

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dafa, L., Peifa, J. (1997). Automated natural deduction prover and experiments. In: Galmiche, D. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 1997. Lecture Notes in Computer Science, vol 1227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027411

Download citation

  • DOI: https://doi.org/10.1007/BFb0027411

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62920-7

  • Online ISBN: 978-3-540-69046-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation