AC Completion with Termination Tools
We present masco tt, a tool for Knuth-Bendix completion modulo the theory of associative and commutative operators. In contrast to classical completion tools, masco tt does not rely on a fixed AC-compatible reduction order. Instead, a suitable order is implicitly constructed during a deduction by collecting all oriented rules in a similar fashion as done in the tool Slothrop. This allows for convergent systems which cannot be completed using standard orders. We outline the underlying inference system and comment on implementation details such as the use of multi-completion, term indexing techniques, and critical pair criteria.
Unable to display preview. Download preview PDF.
- 3.Bachmair, L.: Canonical Equational Proofs. Progress in Theoretical Computer Science. Birkhäuser (1991)Google Scholar
- 9.Gehrke, W.: Detailed catalogue of canonical term rewrite systems generated automatically. Technical report, RISC Linz (1992)Google Scholar
- 15.Kusakari, K.: AC-Termination and Dependency Pairs of Term Rewriting Systems. PhD thesis, JAIST (2000)Google Scholar
- 21.Winkler, S., Sato, H., Middeldorp, A., Kurihara, M.: Optimizing mkbTT (system description). In: Proc. 21st RTA. LIPIcs, vol. 6, pp. 373–384 (2010)Google Scholar