{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T19:05:53Z","timestamp":1648839953480},"reference-count":31,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3485,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0747-7171(03)00070-1","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T17:29:20Z","timestamp":1056994160000},"page":"1-33","source":"Crossref","is-referenced-by-count":7,"title":["Superposition with completely built-in Abelian groups"],"prefix":"10.1016","volume":"37","author":[{"given":"Guillem","family":"Godoy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Nieuwenhuis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(03)00070-1_B1","series-title":"Handbook of Logic in Artificial Intelligence and Logic Programming","article-title":"Unification theory","author":"Baader","year":"1993"},{"key":"10.1016\/S0747-7171(03)00070-1_B2","series-title":"Handbook of Automated Reasoning","first-page":"445","article-title":"Unification theory","author":"Baader","year":"2001"},{"issue":"3","key":"10.1016\/S0747-7171(03)00070-1_B3","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1093\/logcom\/4.3.217","article-title":"Rewrite-based equational theorem proving with selection and simplification","volume":"4","author":"Bachmair","year":"1994","journal-title":"Journal of Logic and Computation"},{"issue":"2","key":"10.1016\/S0747-7171(03)00070-1_B4","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1006\/inco.1995.1131","article-title":"Basic paramodulation","volume":"121","author":"Bachmair","year":"1995","journal-title":"Information and Computation"},{"key":"10.1016\/S0747-7171(03)00070-1_B5","series-title":"LICS, Eleventh Annual IEEE Symposium on Logic in Computer Science","first-page":"456","article-title":"Complexity analysis based on ordered resolution","author":"Basin","year":"1996"},{"key":"10.1016\/S0747-7171(03)00070-1_B6","unstructured":"Le Chenadec, P., 1986. Canonical forms in finitely presented algebras, Research Notes in Theoretical Computer Science. Pitman, London; Wiley, New York, Toronto"},{"issue":"3","key":"10.1016\/S0747-7171(03)00070-1_B7","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","article-title":"Orderings for term-rewriting systems","volume":"17","author":"Dershowitz","year":"1982","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0747-7171(03)00070-1_B8","series-title":"Handbook of Theoretical Computer Science","first-page":"244","article-title":"Rewrite systems","volume":"vol. B","author":"Dershowitz","year":"1990"},{"key":"10.1016\/S0747-7171(03)00070-1_B9","doi-asserted-by":"crossref","unstructured":"Ganzinger, H., de Nivelle, H., 1999. A superposition decision procedure for the guarded fragment with equality. In: LICS, 14th IEEE Symposium on Logic in Computer Science. Trento, Italy, pp.\u00a0295\u2013305","DOI":"10.1109\/LICS.1999.782624"},{"key":"10.1016\/S0747-7171(03)00070-1_B10","doi-asserted-by":"crossref","unstructured":"Ganzinger, H., Meyer, C., Veanes, M., 1999. The two-variable guarded fragment with transitive relations. In: LICS, 14th IEEE Symposium on Logic in Computer Science, Trento, Italy, pp.\u00a024\u201334","DOI":"10.1109\/LICS.1999.782582"},{"key":"10.1016\/S0747-7171(03)00070-1_B11","series-title":"CADE, Thirteenth International Conference on Automated Deduction","first-page":"388","article-title":"Theorem proving in cancellative Abelian monoids","volume":"vol. 1104","author":"Ganzinger","year":"1996"},{"key":"10.1016\/S0747-7171(03)00070-1_B12","series-title":"LICS, 15th IEEE Symposium on Logic in Computer Science","first-page":"413","article-title":"Paramodulation with built-in Abelian groups","author":"Godoy","year":"2000"},{"key":"10.1016\/S0747-7171(03)00070-1_B13","series-title":"LICS, 16th IEEE Symposium on Logic in Computer Science","first-page":"38","article-title":"Ordering constraints for deduction with built-in Abelian semigroups, monoids and groups","author":"Godoy","year":"2001"},{"key":"10.1016\/S0747-7171(03)00070-1_B14","unstructured":"Lankford, D.S., Ballantyne, A.M., 1977. Decision procedures for simple equational theories with commutative-associative axioms: complete sets of commutative-associative reductions, Technical Report Memo ATP-39. Department of Mathematics and Computer Science, University of Texas, Austin, TX"},{"key":"10.1016\/S0747-7171(03)00070-1_B15","doi-asserted-by":"crossref","unstructured":"March\u00e9, C., 1994. Normalised rewriting and normalised completion. In: Ninth Annual IEEE Symposium on Logic in Computer Science, Paris, France. IEEE Computer Society Press. Los Alamitos, CA, USA","DOI":"10.1109\/LICS.1994.316050"},{"issue":"3","key":"10.1016\/S0747-7171(03)00070-1_B16","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1006\/jsco.1996.0011","article-title":"Normalized rewriting: an alternative to rewriting modulo a set of equations","volume":"21","author":"March\u00e9","year":"1996","journal-title":"Journal of Symbolic Computation"},{"key":"10.1016\/S0747-7171(03)00070-1_B17","series-title":"Eleventh Annual IEEE Symposium on Logic in Computer Science","first-page":"473","article-title":"Basic paramodulation and decidable theories","author":"Nieuwenhuis","year":"1996"},{"key":"10.1016\/S0747-7171(03)00070-1_B18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1998.2730","article-title":"Decidability and complexity analysis by basic paramodulation","volume":"147","author":"Nieuwenhuis","year":"1998","journal-title":"Information and Computation"},{"issue":"4","key":"10.1016\/S0747-7171(03)00070-1_B19","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1006\/jsco.1995.1020","article-title":"Theorem proving with ordering and equality constrained clauses","volume":"19","author":"Nieuwenhuis","year":"1995","journal-title":"Journal of Symbolic Computation"},{"issue":"1","key":"10.1016\/S0747-7171(03)00070-1_B20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jsco.1996.0074","article-title":"Paramodulation with built-in AC-theories and symbolic constraints","volume":"23","author":"Nieuwenhuis","year":"1997","journal-title":"Journal of Symbolic Computation"},{"key":"10.1016\/S0747-7171(03)00070-1_B21","series-title":"Handbook of Automated Reasoning","first-page":"371","article-title":"Paramodulation-based theorem proving","author":"Nieuwenhuis","year":"2001"},{"issue":"2","key":"10.1016\/S0747-7171(03)00070-1_B22","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1145\/322248.322251","article-title":"Complete sets of reductions for some equational theories","volume":"28","author":"Peterson","year":"1981","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S0747-7171(03)00070-1_B23","first-page":"73","article-title":"Building in equational theories","volume":"7","author":"Plotkin","year":"1972","journal-title":"Machine Intelligence"},{"issue":"4","key":"10.1016\/S0747-7171(03)00070-1_B24","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1145\/321850.321859","article-title":"Automated theorem-proving for theories with simplifiers, commutativity, and associativity","volume":"21","author":"Slagle","year":"1974","journal-title":"Journal of the ACM"},{"issue":"1\u20132","key":"10.1016\/S0747-7171(03)00070-1_B25","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0304-3975(98)00082-6","article-title":"Superposition theorem proving for Abelian groups represented as integer modules","volume":"208","author":"Stuber","year":"1998","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0747-7171(03)00070-1_B26","doi-asserted-by":"crossref","unstructured":"Stuber, J., 1999. Superposition Theorem Proving for Commutative Algebraic Theories, Dissertation. Technische Fakult\u00e4t, Universit\u00e4t des Saarlandes, Saarbr\u00fccken, Germany","DOI":"10.1007\/978-94-017-0437-3_2"},{"key":"10.1016\/S0747-7171(03)00070-1_B27","series-title":"CADE, 12th International Conference on Automated Deduction","first-page":"530","article-title":"Associative Commutative Deduction with constraints","volume":"vol. 814","author":"Vigneron","year":"1994"},{"key":"10.1016\/S0747-7171(03)00070-1_B28","unstructured":"Waldmann, U., 1997. Cancellative Abelian Monoids in Refutational Theorem Proving, Dissertation. Universit\u00e4t des Saarlandes, Saarbr\u00fccken, Germany"},{"key":"10.1016\/S0747-7171(03)00070-1_B29","series-title":"CADE-98, Proceedings of the Fifteenth International Conference on Automated Deduction","first-page":"144","article-title":"Superposition for divisible torsion-free Abelian monoids","volume":"vol. 1421","author":"Waldmann","year":"1998"},{"key":"10.1016\/S0747-7171(03)00070-1_B30","series-title":"Logic Programming and Automated Reasoning, Int. Conf","first-page":"131","article-title":"Cancellative superposition decides the theory of divisible torsion-free Abelian groups","volume":"vol. 1705","author":"Waldmann","year":"1999"},{"key":"10.1016\/S0747-7171(03)00070-1_B31","series-title":"RTA-93, Proceedings of the 5th International Conference on Rewriting Techniques and Applications","first-page":"32","article-title":"A case study of completion modulo distributivity and Abelian groups","volume":"vol. 690","author":"Zhang","year":"1993"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717103000701?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717103000701?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T14:17:18Z","timestamp":1585059438000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717103000701"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0747717103000701"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(03)00070-1","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}