Skip to Main content Skip to Navigation
Conference papers

Ground Associative and Commutative Completion Modulo Shostak Theories

Sylvain Conchon 1, 2 Evelyne Contejean 1, 2 Mohamed Iguernelala 1, 2 
2 PROVAL - Proof of Programs
UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR
Abstract : AC-completion efficiently handles equality modulo associative and commutative function symbols. In the ground case, the procedure terminates and provides a decision algorithm for the word problem. In this paper, we present a modular extension of ground AC-completion for deciding formulas in the combination of the theory of equality with user-defined AC symbols, uninterpreted symbols and an arbitrary signature disjoint Shostak theory X. The main ideas of our algorithm are first to adapt the definition of rewriting in order to integrate the canonizer of X and second, to replace the equation orientation mechanism found in ground AC-completion with the solver for X
Document type :
Conference papers
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Sylvain Conchon Connect in order to contact the contributor
Submitted on : Friday, November 12, 2010 - 11:32:05 AM
Last modification on : Sunday, June 26, 2022 - 11:52:35 AM
Long-term archiving on: : Friday, October 26, 2012 - 3:30:34 PM


Files produced by the author(s)


  • HAL Id : inria-00535652, version 1



Sylvain Conchon, Evelyne Contejean, Mohamed Iguernelala. Ground Associative and Commutative Completion Modulo Shostak Theories. LPAR, Oct 2010, Yogyakarta, Indonesia. ⟨inria-00535652⟩



Record views


Files downloads