Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Methodologies for Intelligent Systems

ISMIS 1993: Methodologies for Intelligent Systems pp 39–48Cite as

Compiling proof search in semantic tableaux

  • Logic for Artificial Intelligence I
  • Conference paper
  • First Online:

  • 124 Accesses

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

Abstract

An approach to implementing deduction systems based on semantic tableaux is described; it works by compiling a graphical representation of a fully expanded tableaux into a program that performs the search for a proof at runtime. This results in more efficient proof search, since the tableau needs not to be expanded any more, but the proof consists of determining whether it can be closed, only. It is shown how the method can be applied for compiling to the target language Prolog, although any other general purpose language can be used.

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

  • Melvin C. Fitting. First-Order Logic and Automated Theorem Proving. Springer, New York, 1990.

    Google Scholar 

  • Reiner Hähnle & Peter H. Schmitt. The liberalized δ-rule in free variable semantic tableaux. to appear, 1991.

    Google Scholar 

  • Francis Jeffry Pelletier. Seventy-five problems for testing automatic theorem provers. Journal of Automated Reasoning, 2:191–216, 1986.

    Google Scholar 

  • Joachim Posegga & Bertram Ludäscher. Towards first-order deduction based on shannon graphs. In Proc. German Workshop on Artificial Intelligence, LNAI, Bonn, Germany, 1992. Springer.

    Google Scholar 

  • Joachim Posegga. First-order Deduction with Shannon Graphs. PhD thesis, University of Karlsruhe, Karlsruhe, FRG, forthcoming 1993.

    Google Scholar 

  • Mark E. Stickel. A Prolog Technology Theorem Prover. In E. Lusk & R. Overbeek, editors, 9th International Conference on Automated Deduction, Argonne, Ill., May 1988. Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Logik, Komplexität und Deduktionssysteme, Universität Karlsruhe, Am Fasanengarten 5, 7500, Karlsruhe, FRG

    Joachim Posegga

Authors
  1. Joachim Posegga
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan Komorowski Zbigniew W. Raś

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Posegga, J. (1993). Compiling proof search in semantic tableaux. In: Komorowski, J., Raś, Z.W. (eds) Methodologies for Intelligent Systems. ISMIS 1993. Lecture Notes in Computer Science, vol 689. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56804-2_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-56804-2_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47750-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation