Abstract
Refinements of paramodulation (cf. Section 5.3) such as goal reduction (cf. Chapter 7) and narrowing (cf. Chapter 8) are complete only if certain requirements on <SIG,AX> are fulfilled, which, in turn, depend on the division of <SIG,AX> into a base specification <BSIG,BAX> and the rest of <SIG,AX>. The base signature BSIG contains all sorts, predicates and sort-building or constructor functions of SIG. Hence the remaining part of SIG consists of operation symbols called non-constructor or, with the name indicating their meaning,destructor, inquiry, state-transition or value-returning functions. Accordingly, BAX specifies the predicates, in particular the equality predicates, with the help of constructor functions. Non-base axioms must be conditional equations and should only be used to specify non-constructor functions.
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). The Relevance of Constructors. 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_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-73824-1_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-73826-5
Online ISBN: 978-3-642-73824-1
eBook Packages: Springer Book Archive