Skip to main content
SpringerLink
Log in

Generating Small Models of First Order Axioms

  • Conference paper
GWAI-81

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

Abstract

A method for obtaining models of a set of first order sentences obeying certain restrictions is derived from the logical concept of satisfiability. It is explained how systematic proof procedures for propositional logic, developed earlier, can be used to implement this method.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. W. Bibel On Matrices With Connections JACM (to appear)

    Google Scholar 

  2. W. Bibel A Comparison Of Several Proof Procedures AI-Journal (to appear) shortened version in: Proc. AISB-80 Conference on Artificial Intelligence Amsterdam (1980)

    Google Scholar 

  3. W. Bibel, K.M. Hörnig LOPS — A System Based On A Strategical Approach To Program Synthesis Proc. International Workshop On Program Construction Chateau de Bonas INRIA Le Chesnay (1980)

    Google Scholar 

  4. W.W. Bledsoe, A.M. Ballantine On Automatic Generation Of Counterexamples ATP-44A, Univ. of Texas at Austin (1979)

    Google Scholar 

  5. H. Gelernter Realization Of A Geometry Theorem Proving Machine Proc. Int. Conf. Information Processing Paris, UNESCO House (1959) 273–282

    Google Scholar 

  6. L.J. Henschen Semantic Resolution Of Horn Sets Adv. Papers Int. Joint Conf. Artificial Intell. Tbilisi U.S.S.R. (1975)

    Google Scholar 

  7. R. Reiter A Semantically Guided Deductive System For Automatic Theorem Proving IEEE Trans. On Elec. Computing C-25(1976) 328–334

    Google Scholar 

  8. J.R. Slagle Automatic Theorem Proving With Renamable And Semantic Resolution JACM 14 (1967) 687–697

    Article  MathSciNet  MATH  Google Scholar 

  9. R.M. Smullyan First Order Logic Springer, Ergebnisse der Mathematik und ihrer Grenzgebiete Bd. 43 (1968)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. TU München, Postfach 20 24 20, 8000, München 2, West Germany

    K. M. Hörnig

Authors
  1. K. M. Hörnig
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik I, Universität Karlsruhe, Postfach 6380, 7500, Karlsruhe 1, Germany

    Jörg H. Siekmann

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hörnig, K.M. (1981). Generating Small Models of First Order Axioms. In: Siekmann, J.H. (eds) GWAI-81. Informatik-Fachberichte, vol 47. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-02328-0_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-02328-0_23

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-662-02328-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation