Polynomial Path Orders
This paper is concerned with the complexity analysis of constructor term rewrite systems and its ramification in implicit computational complexity. We introduce a path order with multiset status, the polynomial path order POP*, that is applicable in two related, but distinct contexts. On the one han...
| 出版年: | Logical Methods in Computer Science |
|---|---|
| 主要な著者: | , |
| フォーマット: | 論文 |
| 言語: | 英語 |
| 出版事項: |
Logical Methods in Computer Science e.V.
2013-11-01
|
| 主題: | |
| オンライン･アクセス: | https://lmcs.episciences.org/807/pdf |
| _version_ | 1850055032684150784 |
|---|---|
| author | Martin Avanzini Georg Moser |
| author_facet | Martin Avanzini Georg Moser |
| author_sort | Martin Avanzini |
| collection | DOAJ |
| container_title | Logical Methods in Computer Science |
| description | This paper is concerned with the complexity analysis of constructor term
rewrite systems and its ramification in implicit computational complexity. We
introduce a path order with multiset status, the polynomial path order POP*,
that is applicable in two related, but distinct contexts. On the one hand POP*
induces polynomial innermost runtime complexity and hence may serve as a
syntactic, and fully automatable, method to analyse the innermost runtime
complexity of term rewrite systems. On the other hand POP* provides an
order-theoretic characterisation of the polytime computable functions: the
polytime computable functions are exactly the functions computable by an
orthogonal constructor TRS compatible with POP*. |
| format | Article |
| id | doaj-art-e6cb83b19c4a4d35b8ee8ea70db5ce6c |
| institution | Directory of Open Access Journals |
| issn | 1860-5974 |
| language | English |
| publishDate | 2013-11-01 |
| publisher | Logical Methods in Computer Science e.V. |
| record_format | Article |
| spelling | doaj-art-e6cb83b19c4a4d35b8ee8ea70db5ce6c2025-08-20T00:24:28ZengLogical Methods in Computer Science e.V.Logical Methods in Computer Science1860-59742013-11-01Volume 9, Issue 410.2168/LMCS-9(4:9)2013807Polynomial Path OrdersMartin AvanziniGeorg MoserThis paper is concerned with the complexity analysis of constructor term rewrite systems and its ramification in implicit computational complexity. We introduce a path order with multiset status, the polynomial path order POP*, that is applicable in two related, but distinct contexts. On the one hand POP* induces polynomial innermost runtime complexity and hence may serve as a syntactic, and fully automatable, method to analyse the innermost runtime complexity of term rewrite systems. On the other hand POP* provides an order-theoretic characterisation of the polytime computable functions: the polytime computable functions are exactly the functions computable by an orthogonal constructor TRS compatible with POP*.https://lmcs.episciences.org/807/pdfcomputer science - logic in computer science |
| spellingShingle | Martin Avanzini Georg Moser Polynomial Path Orders computer science - logic in computer science |
| title | Polynomial Path Orders |
| title_full | Polynomial Path Orders |
| title_fullStr | Polynomial Path Orders |
| title_full_unstemmed | Polynomial Path Orders |
| title_short | Polynomial Path Orders |
| title_sort | polynomial path orders |
| topic | computer science - logic in computer science |
| url | https://lmcs.episciences.org/807/pdf |
| work_keys_str_mv | AT martinavanzini polynomialpathorders AT georgmoser polynomialpathorders |