Abstract
The purpose of this tutorial is to introduce the Automated Deduction community to a growing area in which their expertise can be applied to a novel set of problems. No knowledge of natural language processing will be assumed. (If you have time for some background reading, James Allen’s ‘Natural Language Understanding’, 2nd edition, Addison Wesley, 1995 can be recommended).
In this tutorial I will describe and illustrate some of the areas in which NLU interacts with theorem proving, and say what our problems are. My hope is that out of this you will get some interesting new problems to work on, and that we will eventually get answers to some of our questions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pulman, S. (2000). Tutorial: Automated Deduction and Natural Language Understanding. 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_43
Download citation
DOI: https://doi.org/10.1007/10721959_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67664-5
Online ISBN: 978-3-540-45101-3
eBook Packages: Springer Book Archive