M. Iwami (Japan)
: Model-based reasoning, Term rewriting system, Termination, Persistence
A property P is called persistent if for any many sorted term rewriting system R, R has the property P if and only if term rewriting system (R), which results from R by omitting its sort information, has the property P. In this paper, we show that termi nation is persistent for locally confluent overlay term rewriting systems and we give the example as ap plication of this result. Furthermore we obtain that completeness is persistent for locally confluent over lay term rewriting systems.
Important Links:
Go Back
