Abstract
Both HERBY and THEO use only two inference procedures to derive new clauses from a given set of clauses; the procedures are called binary resolution and binary factoring. To understand how these procedures derive new clauses, a number of terms must be introduced — in particular, substitution, instance, unification, subsumption and most general unifier. An informal introduction to this material, however, is given first.
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
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media New York
About this chapter
Cite this chapter
Newborn, M. (2001). Inference Procedures. In: Automated Theorem Proving. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-0089-2_4
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0089-2_4
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6519-1
Online ISBN: 978-1-4613-0089-2
eBook Packages: Springer Book Archive