Skip to main content

Workshop: Model Computation – Principles, Algorithms, Applications

  • Conference paper
Automated Deduction - CADE-17 (CADE 2000)

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

Included in the following conference series:

  • 474 Accesses

Abstract

Computing models of first-order or propositional logic specifications is the complementary problem of refutational theorem proving. A deduction system capable of producing models significantly extends the functionality of purely refutational systems by providing the user with useful information in case that no refutation exists.

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

Access this chapter

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baumgartner, P., Fermueller, C., Peltier, N., Zhang, H. (2000). Workshop: Model Computation – Principles, Algorithms, Applications. In: McAllester, D. (eds) Automated Deduction - CADE-17. CADE 2000. Lecture Notes in Computer Science(), vol 1831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10721959_45

Download citation

  • DOI: https://doi.org/10.1007/10721959_45

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67664-5

  • Online ISBN: 978-3-540-45101-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics