Location of Repository

Persistence of termination for locally confluent overlay term rewriting systems

By Munehiro Iwami

Abstract

Abstract — A property is called persistent if for any manysorted term rewriting system, has the property if and only if term rewriting system, which results from by omitting its sort information, has the property. In this paper, we show that termination is persistent for locally confluent overlay term rewriting systems and we give the example as application of this result. Furthermore we obtain that completeness is persistent for locally confluent overlay term rewriting systems

Topics: Theory of computing, Model-based reasoning, Term
Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.308.5953
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.waset.org/journals/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.