TERMINATION OF CYCLE REWRITING BY TRANSFORMATION AND MATRIX INTERPRETATION
- Sabel, D.
- Zantema, H.
Publication date
January 2017
DOIAbstract
Contains fulltext : 173225.pdf (publisher's version ) (Open Access
Contains fulltext : 173225.pdf (publisher's version ) (Open Access
We present a new method for automatically proving termination of term rewriting. It is based on the ...
This paper presents a extention of the matrix interpretation ordering for term rewriting system term...
SIGLECNRS 14802 E / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
We present techniques to prove termination of cycle rewriting, that is, string rewriting on cycles, ...
Contains fulltext : 71920.pdf (preprint version ) (Open Access)34th Conference on ...
We present new techniques to prove termination of cycle rewriting, that is, string rewriting on cycl...
Contains fulltext : 134622.pdf (preprint version ) (Closed access
Contains fulltext : 111092.pdf (publisher's version ) (Open Access
Contains fulltext : 13341.pdf (publisher's version ) (Open Access
Contains fulltext : 143775.pdf (publisher's version ) (Open Access)RTA 2015 : 26th...
We present a new method for automatically proving termination of term rewriting. It is based on the ...
String rewriting can not only be applied on strings, but also on cycles and even on general graphs. ...
We present a new method for automatically proving termination of term rewriting. It is based on the ...
This paper presents a extention of the matrix interpretation ordering for term rewriting system term...
SIGLECNRS 14802 E / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
We present techniques to prove termination of cycle rewriting, that is, string rewriting on cycles, ...
Contains fulltext : 71920.pdf (preprint version ) (Open Access)34th Conference on ...
We present new techniques to prove termination of cycle rewriting, that is, string rewriting on cycl...
Contains fulltext : 134622.pdf (preprint version ) (Closed access
Contains fulltext : 111092.pdf (publisher's version ) (Open Access
Contains fulltext : 13341.pdf (publisher's version ) (Open Access
Contains fulltext : 143775.pdf (publisher's version ) (Open Access)RTA 2015 : 26th...
We present a new method for automatically proving termination of term rewriting. It is based on the ...
String rewriting can not only be applied on strings, but also on cycles and even on general graphs. ...
We present a new method for automatically proving termination of term rewriting. It is based on the ...
This paper presents a extention of the matrix interpretation ordering for term rewriting system term...
SIGLECNRS 14802 E / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
Add to ORKG