LIPIcs.RTA.2012.165.pdf
- Filesize: 475 kB
- 11 pages
Document
Deciding Confluence of Ground Term Rewrite Systems in Cubic Time
Author
-
Part of:
Volume:
23rd International Conference on Rewriting Techniques and Applications (RTA'12) (RTA 2012)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Rewriting Techniques and Applications (RTA) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2012-05-29
Cite As Get BibTex
Bertram Felgenhauer. Deciding Confluence of Ground Term Rewrite Systems in Cubic Time. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 165-175, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
https://doi.org/10.4230/LIPIcs.RTA.2012.165
Abstract
It is well known that the confluence property of ground term rewrite systems (ground TRSs) is decidable in polynomial time. For an efficient implementation, the degree of this polynomial is of great interest. The best complexity bound in the literature is given by Comon, Godoy and Nieuwenhuis (2001), who describe an O(n^5) algorithm, where n is the size of the ground TRS. In this paper we improve this bound to O(n^3). The algorithm has been implemented in the confluence tool CSI.
Subject Classification
Keywords
- confluence
- ground rewrite systems
- decidability
- polynomial time
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads