{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:37:04Z","timestamp":1753889824952,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2012,9,14]],"date-time":"2012-09-14T00:00:00Z","timestamp":1347580800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>AC-completion efficiently handles equality modulo associative and commutative\nfunction symbols. When the input is ground, the procedure terminates and\nprovides a decision algorithm for the word problem. In this paper, we present a\nmodular extension of ground AC-completion for deciding formulas in the\ncombination of the theory of equality with user-defined AC symbols,\nuninterpreted symbols and an arbitrary signature disjoint Shostak theory X. Our\nalgorithm, called AC(X), is obtained by augmenting in a modular way ground\nAC-completion with the canonizer and solver present for the theory X. This\nintegration rests on canonized rewriting, a new relation reminiscent to\nnormalized rewriting, which integrates canonizers in rewriting steps. AC(X) is\nproved sound, complete and terminating, and is implemented to extend the core\nof the Alt-Ergo theorem prover.<\/jats:p>","DOI":"10.2168\/lmcs-8(3:16)2012","type":"journal-article","created":{"date-parts":[[2013,11,29]],"date-time":"2013-11-29T08:17:46Z","timestamp":1385713066000},"source":"Crossref","is-referenced-by-count":10,"title":["Canonized Rewriting and Ground AC Completion Modulo Shostak Theories : Design and Implementation"],"prefix":"10.46298","volume":"Volume 8, Issue 3","author":[{"given":"Sylvain","family":"Conchon","sequence":"first","affiliation":[]},{"given":"Evelyne","family":"Contejean","sequence":"additional","affiliation":[]},{"given":"Mohamed","family":"Iguernelala","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2012,9,14]]},"reference":[{"key":"685:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/1034\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/1034\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:01:45Z","timestamp":1681243305000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/1034"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,14]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-8(3:16)2012","relation":{"is-same-as":[{"id-type":"arxiv","id":"1207.3262","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1207.3262","asserted-by":"subject"}],"is-referenced-by":[{"id-type":"doi","id":"10.1007\/978-3-030-20652-9_6","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2012,9,14]]},"article-number":"1034"}}