Abstract
The main problem with using semantics to guide automated theorem proving systems is the overhead involved in performing the semantic checks. When the semantics provide effective guidance, the overhead is more than offset by the reduction in the search space. This leads to the question: “What are good semantics and how can the best semantics be selected from a range of choices?”. This paper proposes one solution based on the semantic guidance system used in the PTTP+GLiDeS theorem prover.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brown, M. (2002). Selecting Semantics for Use with Semantic Pruning of Linear Deductions. In: McKay, B., Slaney, J. (eds) AI 2002: Advances in Artificial Intelligence. AI 2002. Lecture Notes in Computer Science(), vol 2557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36187-1_68
Download citation
DOI: https://doi.org/10.1007/3-540-36187-1_68
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00197-3
Online ISBN: 978-3-540-36187-9
eBook Packages: Springer Book Archive