Skip to main content
SpringerLink
Log in

Reasoning about Theories with a Finite Model

  • Conference paper
3. Österreichische Artificial-Intelligence-Tagung

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

Abstract

Enumeration types of Pascal are theories with a finite model. This paper presents a general reduction and decision procedure for these theories. The procedure may be used when logical formualae with subformulae belonging to diverse theories must be simplified.

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

Access this chapter

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Deussen: Analytische Tableaux Unpublished Lecture Notes, Karlsruhe: 1975

    Google Scholar 

  2. C.A.R. Hoare, N. Wirth: An Axiomatic Definition of the Programming Language PASCAL Acta Informatica 2, pp. 335–355: 1973

    Google Scholar 

  3. K. Jensen, N. Wirth: Pascal: User Manual and Report Berlin, Heidelberg, New York, Tokyo: 1983; Springer

    Google Scholar 

  4. Th. Käufl: Reasoning about Theories with a Finite Model Technical Report: forthcoming

    Google Scholar 

  5. Th. Käufl: The Simplifier of the Program Verifier “Tatzelwurm” Österreichische Artificial Intelligence-Tagung 1985

    Google Scholar 

  6. Th. Käufl: Informatik-Fachberichte; Berlin, Heidelberg, New York: 1985; Springer

    Google Scholar 

  7. C.G. Nelson, Q.C. Oppen: Simplification by Cooperating Decision Procedures ACM TOPLAS 1, pp. 245–257: 1979

    MATH  Google Scholar 

  8. M.M. Richter: Logikkalküle Stuttgart: 1978

    Google Scholar 

  9. R.M. Smuliyan: First-Order Logic Berlin, Heidelberg, New York: 1968

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik 1, Universität Karlsruhe, Kaiserstr. 12, 7500, Karlsruhe 1, Western Germany

    Thomas Käufl

Authors
  1. Thomas Käufl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Medizinische Kybernetik und Artificial Intelligence, Universität Wien, Freyung 6/2, A-1010, Wien, Österreich

    Ernst Buchberger

  2. Siemens AG Österreich, Göllnergasse 15, A-1030, Wien, Österreich

    Johannes Retti

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Käufl, T. (1987). Reasoning about Theories with a Finite Model. In: Buchberger, E., Retti, J. (eds) 3. Österreichische Artificial-Intelligence-Tagung. Informatik-Fachberichte, vol 151. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46620-5_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-46620-5_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18384-6

  • Online ISBN: 978-3-642-46620-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation