| dc.contributor.author | Nagele, J | en_US |
| dc.contributor.author | Felgenhauer, B | en_US |
| dc.contributor.author | Zankl, H | en_US |
| dc.date.accessioned | 2018-05-10T12:55:06Z | |
| dc.date.available | 2016-12-12 | en_US |
| dc.date.issued | 2017 | en_US |
| dc.date.submitted | 2018-05-02T16:41:07.490Z | |
| dc.identifier.issn | 1860-5974 | en_US |
| dc.identifier.other | 4 | |
| dc.identifier.other | 4 | |
| dc.identifier.other | ARTN 4 | en_US |
| dc.identifier.other | ARTN 4 | en_US |
| dc.identifier.uri | http://qmro.qmul.ac.uk/xmlui/handle/123456789/37284 | |
| dc.relation.ispartof | LOGICAL METHODS IN COMPUTER SCIENCE | en_US |
| dc.rights | This work is licensed under a Creative Commons Attribution 4.0 International License. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in the credit line; if the material is not included under the Creative Commons license, users will need to obtain permission from the license holder to reproduce the material. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/ | |
| dc.subject | term rewriting | en_US |
| dc.subject | confluence | en_US |
| dc.subject | decreasing diagrams | en_US |
| dc.subject | certification | en_US |
| dc.title | CERTIFYING CONFLUENCE PROOFS VIA RELATIVE TERMINATION AND RULE LABELING | en_US |
| dc.type | Article | |
| dc.rights.holder | © The Author(s) 2017 | |
| dc.identifier.doi | 10.23638/LMCS-13(2:4)2017 | en_US |
| pubs.author-url | http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000419160800011&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=612ae0d773dcbdba3046f6df545e9f6a | en_US |
| pubs.issue | 2 | en_US |
| pubs.notes | No embargo | en_US |
| pubs.publication-status | Published | en_US |
| pubs.volume | 13 | en_US |
