Abstract
In the last chapter we presented a set of transformations BT complete for arbitrary equational theories E, but which were prohibitively inefficient. In this chapter we present a restricted version of BT, called T, which solves these problems, and prove its completeness.
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
© 1991 Springer Science+Business Media New York
About this chapter
Cite this chapter
Snyder, W. (1991). An Improved Set of Transformations. In: A Proof Theory for General Unification. Progress in Computer Science and Applied Logic, vol 11. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0435-0_6
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0435-0_6
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6758-4
Online ISBN: 978-1-4612-0435-0
eBook Packages: Springer Book Archive