Abstract
In the previous chapter, we introduced the Base Assumption (cf. Section 6.1) that is fundamental for refinements of resolution and paramodulation such as goal reduction (handled in this chapter) and narrowing (treated in the next chapter). Both rules are specializations of the Paramodulation Rule (cf. Section 5.3). Goal reduction differs from paramodulation in the following respects.
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
© 1988 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Padawitz, P. (1988). Reduction. In: Computing in Horn Clause Theories. EATCS Monographs on Theoretical Computer Science, vol 16. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-73824-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-73824-1_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-73826-5
Online ISBN: 978-3-642-73824-1
eBook Packages: Springer Book Archive