Skip to main content
SpringerLink
Log in

Propositional Programs and Minimal Models

  • Chapter
  • First Online:
Answer Set Programming

  • 1984 Accesses

Abstract

In this chapter and the next, we discuss the mathematical definition of a stable model. In the process, we introduce a few syntactic features of the input language of clingo that have not been mentioned earlier.

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 EPUB and 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
Hardcover Book
USD 64.99
Price excludes VAT (USA)
  • Durable hardcover 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

Change history

  • 20 November 2019

    The book was inadvertently published with an incorrect format for table as

References

  1. Artificial Intelligence, 13(1,2), 1980.

    Google Scholar 

  2. Martin Gebser, Amelia Harrison, Roland Kaminski, Vladimir Lifschitz, and Torsten Schaub. Abstract gringo. Theory and Practice of Logic Programming, 15:449–463, 2015.

    Article  MathSciNet  Google Scholar 

  3. W.L. Harper, G.A. Pearce, and R. Stalnaker, editors. IFS: Conditionals, Belief, Decision, Chance and Time. Springer, 1980.

    Google Scholar 

  4. Vladimir Lifschitz. Intelligent instantiation and supersafe rules. In Technical Communications of the 28th International Conference on Logic Programming (ICLP), 2016.

    Google Scholar 

  5. John McCarthy. Circumscription—a form of non-monotonic reasoning. Artificial Intelligence, 13:27–39,171–172, 1980.

    Google Scholar 

  6. John McCarthy. Applications of circumscription to formalizing common sense knowledge. Artificial Intelligence, 26(3):89–116, 1986.

    Article  MathSciNet  Google Scholar 

  7. Emil Post. Introduction to a general theory of elementary propositions. American Journal of Mathematics, 43(1):163–185, 1921.

    Article  MathSciNet  Google Scholar 

  8. Ludwig Wittgenstein. Tractatus Logico-philosophicus. International library of psychology, philosophy, and scientific method. Harcourt, Brace & Company, 1922.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Texas at Austin, Austin, TX, USA

    Vladimir Lifschitz

Authors
  1. Vladimir Lifschitz
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Lifschitz, V. (2019). Propositional Programs and Minimal Models. In: Answer Set Programming. Springer, Cham. https://doi.org/10.1007/978-3-030-24658-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-24658-7_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-24657-0

  • Online ISBN: 978-3-030-24658-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation