{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:00:04Z","timestamp":1762459204111,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2014,4,1]],"date-time":"2014-04-01T00:00:00Z","timestamp":1396310400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>All current investigations to analyze the derivational complexity of term\nrewrite systems are based on a single termination method, possibly preceded by\ntransformations. However, the exclusive use of direct criteria is problematic\ndue to their restricted power. To overcome this limitation the article\nintroduces a modular framework which allows to infer (polynomial) upper bounds\non the complexity of term rewrite systems by combining different criteria.\nSince the fundamental idea is based on relative rewriting, we study how matrix\ninterpretations and match-bounds can be used and extended to measure complexity\nfor relative rewriting, respectively. The modular framework is proved strictly\nmore powerful than the conventional setting. Furthermore, the results have been\nimplemented and experiments show significant gains in power.<\/jats:p>","DOI":"10.2168\/lmcs-10(1:19)2014","type":"journal-article","created":{"date-parts":[[2014,7,15]],"date-time":"2014-07-15T09:40:14Z","timestamp":1405417214000},"source":"Crossref","is-referenced-by-count":7,"title":["Modular Complexity Analysis for Term Rewriting"],"prefix":"10.46298","volume":"Volume 10, Issue 1","author":[{"given":"Harald","family":"Zankl","sequence":"first","affiliation":[]},{"given":"Martin","family":"Korp","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2014,4,1]]},"reference":[{"key":"528:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/749\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/749\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T19:55:17Z","timestamp":1681242917000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/749"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,1]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-10(1:19)2014","relation":{"is-same-as":[{"id-type":"arxiv","id":"1402.0746","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1402.0746","asserted-by":"subject"}],"is-referenced-by":[{"id-type":"arxiv","id":"1410.8220","asserted-by":"subject"},{"id-type":"doi","id":"10.4204\/eptcs.167.8","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arxiv.1410.8220","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2014,4,1]]},"article-number":"749"}}