Skip to main content

Limitations of Logic

  • Chapter
  • First Online:
Introduction to Artificial Intelligence

Part of the book series: Undergraduate Topics in Computer Science ((UTICS))

  • 417k Accesses

Abstract

Until the end of the 20th century many logicians believed that theorem provers for first-order logic will be the major component of intelligent agents. Almost all successful modern AI applications however use different formalisms. This is due to some severe problems with first-order logic that we will explain in this chapter.

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

Access this chapter

Institutional subscriptions

Notes

  1. 1.

    www.mathweb.org/mathweb/demo.html.

  2. 2.

    Just this case is especially important in practice, because if I already know that a statement is true, I no longer need a prover.

  3. 3.

    The formal execution of this and the following simple proof may be left to the reader (Exercise 4.3 on page 73).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wolfgang Ertel .

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Ertel, W. (2017). Limitations of Logic. In: Introduction to Artificial Intelligence. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-58487-4_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-58487-4_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-58486-7

  • Online ISBN: 978-3-319-58487-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics