A certified AC matching algorithm

Evelyne Contejean

Abstract: In this paper, we propose a matching algorithm for terms containing some function symbols which can be either free, commutative or associative-commutative. This algorithm is presented by inference rules and these rules have been formally proven sound and complete, and decreasing in the COQ proof assistant while the corresponding algorithm is implemented in the CiME system. Moreover some preparatory work has been done in COQ, such as proving that checking the equality of two terms modulo some commutative and associative-commutative theories is decidable.

This document was translated from LATEX by HEVEA.