Skip to main content
SpringerLink
Log in
Book cover

GWAI-87 11th German Workshop on Artifical Intelligence pp 211–220Cite as

Resolution on Formula-Trees

  • Conference paper

  • 77 Accesses

Part of the book series: Informatik-Fachberichte ((2252,volume 152))

Abstract

We introduce a nonclausal resolution calculus on formula-trees which comprises classical resolution as a special case. The resolvents produced in this calculus are more structure preserving than in nonclausal resolution by Murray and Manna and Waldinger and simpler than in nested resolution by Traugott. Proofs of correctness and completeness are sketched. In some examples, first experiences made when implementing the calculus are discussed.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bibel, W., Automated Theorem Proving, Vieweg, Braunschweig 1982

    Book  MATH  Google Scholar 

  2. Chang, C.-L. and Lee, R.C.-T., Symbolic Logic and Mechanical Theorem Proving, Academic Press, New York 1973

    MATH  Google Scholar 

  3. Gallier, J., Logic for Computer Science, Harper and Row, New York 1986

    MATH  Google Scholar 

  4. Gentzen, G., Untersuchungen über das logische Schließen, Math. Z. 39 (1934) 176-210, 405 - 431

    Google Scholar 

  5. Manna, Z. and Waldinger, R., Special relations in automated deduction, Journal of the ACM 33 (1986) No. 1, 1 - 59

    Article  MathSciNet  MATH  Google Scholar 

  6. Murray, N. V., Completely non-clausal theorem proving, Artificial Intelligence 18 (1982) 67 - 85

    Article  MathSciNet  MATH  Google Scholar 

  7. Nilsson, N. J., Principles of Artificial Intelligence, Tioga Publ. Co. 1980

    MATH  Google Scholar 

  8. Robinson, J. A., A machine-oriented logic based on the resolution principle, Journal of the ACM 12,1 (1965) 23 - 41

    Google Scholar 

  9. Traugott, J., Nested Resolution, Proc. 8th Conf. on Autom. Deduct., 1986, SLNCS 230, 394-402

    Google Scholar 

  10. Walther, C., A mechanical solution of Schubert’s Steamroller by many-sorted resolution, Artificial Intelligence 26,2 (1985) 217 - 224

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematisches Institut, Universität München, Theresienstraße 39, 8000, München 2, Germany

    Ulf R. Schmerl

Authors
  1. Ulf R. Schmerl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Projektgruppe KIT, Sekr. FR 5–8, Technische Universität Berlin, Franklinstraße 28/29, D-1000, Berlin 10, Deutschland

    Katharina Morik

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schmerl, U.R. (1987). Resolution on Formula-Trees. In: Morik, K. (eds) GWAI-87 11th German Workshop on Artifical Intelligence. Informatik-Fachberichte, vol 152. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-73005-4_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-73005-4_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18388-4

  • Online ISBN: 978-3-642-73005-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation