{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:23:32Z","timestamp":1725578612665},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642198342"},{"type":"electronic","value":"9783642198359"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19835-9_6","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T15:03:16Z","timestamp":1300114996000},"page":"45-59","source":"Crossref","is-referenced-by-count":1,"title":["Canonized Rewriting and Ground AC Completion Modulo Shostak Theories"],"prefix":"10.1007","author":[{"given":"Sylvain","family":"Conchon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evelyne","family":"Contejean","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Iguernelala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"6_CR2","unstructured":"Bachmair, L., Dershowitz, N., Hsiang, J.: Orderings for equational proofs. In: Proc. 1st LICS, Cambridge, Mass., pp. 346\u2013357 (June 1986)"},{"issue":"2","key":"6_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1023\/B:JARS.0000009518.26415.49","volume":"31","author":"L. Bachmair","year":"2003","unstructured":"Bachmair, L., Tiwari, A., Vigneron, L.: Abstract congruence closure. Journal of Automated Reasoning\u00a031(2), 129\u2013168 (2003)","journal-title":"Journal of Automated Reasoning"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Conchon, S., Contejean, E., Iguernelala, M.: Canonized Rewriting and Ground AC Completion Modulo Shostak Theories. Research Report 1538, LRI (December 2010)","DOI":"10.1007\/978-3-642-19835-9_6"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-540-25979-4_5","volume-title":"Rewriting Techniques and Applications","author":"E. Contejean","year":"2004","unstructured":"Contejean, E.: A certified AC matching algorithm. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 70\u201384. Springer, Heidelberg (2004)"},{"issue":"3","key":"6_CR6","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"N. Dershowitz","year":"1982","unstructured":"Dershowitz, N.: Orderings for term rewriting systems. Theoretical Computer Science\u00a017(3), 279\u2013301 (1982)","journal-title":"Theoretical Computer Science"},{"key":"6_CR7","first-page":"243","volume-title":"Handbook of Theoretical Computer Science","author":"N. Dershowitz","year":"1990","unstructured":"Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, pp. 243\u2013320. North-Holland, Amsterdam (1990)"},{"key":"6_CR8","unstructured":"Conchon, S., Contejean, E., Bobot, F., Lescuyer, S., Iguernelala, M.: The Alt-Ergo theorem prover, \n                    \n                      http:\/\/alt-ergo.lri.fr"},{"key":"6_CR9","unstructured":"Hullot, J.-M.: Associative commutative pattern matching. In: Proc. 6th IJCAI, Tokyo, vol.\u00a0I, pp. 406\u2013412 (August 1979)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Jouannaud, J.-P., Kirchner, H.: Completion of a set of rules modulo a set of equations. SIAM Journal on Computing 15(4) (November 1986)","DOI":"10.1137\/0215084"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Rewriting Techniques and Applications","author":"D. Kapur","year":"1997","unstructured":"Kapur, D.: Shostak\u2019s congruence closure as completion. In: Comon, H. (ed.) RTA 1997. LNCS, vol.\u00a01232. Springer, Heidelberg (1997)"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/B978-0-08-012975-4.50028-X","volume-title":"Computational Problems in Abstract Algebra","author":"D.E. Knuth","year":"1970","unstructured":"Knuth, D.E., Bendix, P.B.: Simple word problems in universal algebras. In: Leech, J. (ed.) Computational Problems in Abstract Algebra, pp. 263\u2013297. Pergamon Press, Oxford (1970)"},{"issue":"1-2","key":"6_CR13","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.ic.2004.11.001","volume":"199","author":"S. Krsti\u0107","year":"2005","unstructured":"Krsti\u0107, S., Conchon, S.: Canonization for disjoint unions of theories. Information and Computation\u00a0199(1-2), 87\u2013106 (2005)","journal-title":"Information and Computation"},{"key":"6_CR14","unstructured":"Lankford, D.S.: Canonical inference. Memo ATP-32, University of Texas at Austin (March 1975)"},{"key":"6_CR15","unstructured":"Lankford, D.S., Ballantyne, A.M.: Decision procedures for simple equational theories with permutative axioms: Complete sets of permutative reductions. Memo ATP-37, University of Texas, Austin, Texas, USA (August 1977)"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-53904-2_114","volume-title":"Rewriting Techniques and Applications","author":"C. March\u00e9","year":"1991","unstructured":"March\u00e9, C.: On ground AC-completion. In: Book, R.V. (ed.) RTA 1991. LNCS, vol.\u00a0488. Springer, Heidelberg (1991)"},{"issue":"3","key":"6_CR17","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1006\/jsco.1996.0011","volume":"21","author":"C. March\u00e9","year":"1996","unstructured":"March\u00e9, C.: Normalized rewriting: an alternative to rewriting modulo a set of equations. Journal of Symbolic Computation\u00a021(3), 253\u2013288 (1996)","journal-title":"Journal of Symbolic Computation"},{"issue":"2","key":"6_CR18","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/357073.357079","volume":"1","author":"G. Nelson","year":"1979","unstructured":"Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM Trans. on Programming, Languages and Systems\u00a01(2), 245\u2013257 (1979)","journal-title":"ACM Trans. on Programming, Languages and Systems"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","volume-title":"Rewriting Techniques and Applications","author":"R. Nieuwenhuis","year":"1993","unstructured":"Nieuwenhuis, R., Rubio, A.: A precedence-based total AC-compatible ordering. In: Kirchner, C. (ed.) RTA 1993. LNCS, vol.\u00a0690. Springer, Heidelberg (1993)"},{"issue":"2","key":"6_CR20","first-page":"233","volume":"28","author":"G.E. Peterson","year":"1981","unstructured":"Peterson, G.E., Stickel, M.E.: Complete sets of reductions for some equational theories. J.\u00a0ACM\u00a028(2), 233\u2013264 (1981)","journal-title":"J.\u00a0ACM"},{"key":"6_CR21","first-page":"1","volume":"31","author":"R.E. Shostak","year":"1984","unstructured":"Shostak, R.E.: Deciding combinations of theories. J.\u00a0ACM\u00a031, 1\u201312 (1984)","journal-title":"J.\u00a0ACM"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19835-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T10:31:05Z","timestamp":1558434665000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19835-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642198342","9783642198359"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19835-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}