Electronic Resource
Springer
Applicable algebra in engineering, communication and computing
7 (1996), S. 469-511
ISSN:
1432-0622
Keywords:
Term rewriting system
;
Termination
;
Semantic path ordering
;
General path ordering
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
,
Technology
Notes:
Abstract We define a strong and versatile termination order for term rewriting systems, called theImproved General Path Order, which simplifies and strengthens Dershowitz/Hoot's General Path Order. We demonstrate the power of the Improved General Path Order by proofs of termination of non-trivial examples, among them a medium-scale term rewriting system that models a lift control.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01293264
Permalink
|
Location |
Call Number |
Expected |
Availability |