{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:06:17Z","timestamp":1742911577722,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540646754"},{"type":"electronic","value":"9783540691105"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054257","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T07:28:51Z","timestamp":1149665331000},"page":"144-159","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Superposition for divisible torsion-free abelian groups"],"prefix":"10.1007","author":[{"given":"Uwe","family":"Waldmann","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,25]]},"reference":[{"key":"18_CR1","first-page":"1","volume-title":"LNCS 968","author":"L. Bachmair","year":"1994","unstructured":"Leo Bachmair and Harald Ganzinger. Associative-commutative superposition. In Nachum Dershowitz and Naomi Lindenstrauss, eds., Conditional and Typed Rewriting Systems, 4th International Workshop, CTRS-94, Jerusalem, Israel, July 13\u201315, 1994, LNCS 968, pp. 1\u201314. Springer-Verlag."},{"issue":"3","key":"18_CR2","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1093\/logcom\/4.3.217","volume":"4","author":"L. Bachmair","year":"1994","unstructured":"Leo Bachmair and Harald Ganzinger. Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation, 4(3):217\u2013247, 1994.","journal-title":"Journal of Logic and Computation"},{"key":"18_CR3","first-page":"388","volume-title":"LNAI 1104","author":"H. Ganzinger","year":"1996","unstructured":"Harald Ganzinger and Uwe Waldmann. Theorem proving in cancellative abelian monoids (extended abstract). In Michael A. McRobbie and John K. Slaney, eds., Automated Deduction \u2014 CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30\u2013August 3, 1996, LNAI 1104, pp. 388\u2013402. Springer-Verlag."},{"issue":"3","key":"18_CR4","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1006\/jsco.1996.0011","volume":"21","author":"C. March\u00e9","year":"1996","unstructured":"Claude March\u00e9. Normalized rewriting: an alternative to rewriting modulo a set of equations. Journal of Symbolic Computation, 21(3):253\u2013288, March 1996.","journal-title":"Journal of Symbolic Computation"},{"issue":"1","key":"18_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF01270929","volume":"6","author":"M. Rusinowitch","year":"1995","unstructured":"Micha\u00cbl Rusinowitch and Laurent Vigneron. Automated deduction with associative-commutative operators. Applicable Algebra in Engineering, Communication and Computing, 6(1):23\u201356, January 1995.","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"18_CR6","first-page":"33","volume-title":"LNCS 1103","author":"J. Stuber","year":"1996","unstructured":"J\u00fcrgen Stuber. Superposition theorem proving for abelian groups represented as integer modules. In Harald Ganzinger, ed., Rewriting Techniques and Applications, 7th International Conference, RTA-96, New Brunswick, NJ, USA, July 27\u201330, 1996, LNCS 1103, pp. 33\u201347. Springer-Verlag."},{"key":"18_CR7","volume-title":"PhD thesis","author":"U. Waldmann","year":"1997","unstructured":"Uwe Waldmann. Cancellative Abelian Monoids in Refutational Theorem Proving. PhD thesis, Universit\u00c4t des Saarlandes, Saarbr\u00fccken, Germany, 1997. http:\/\/www.mpi-sb.mpg.de\/~uwe\/paper\/PhD.ps.gz"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Uwe Wadmann. Extending reduction orderings to ACU-compatible reduction orderings. http:\/\/www.mpi-sb.mpg.de\/~uwe\/paper\/ACUExt.ps.gz. Submitted, 1997.","DOI":"10.1016\/S0020-0190(98)00084-2"},{"key":"18_CR9","volume-title":"Technical Report MPI-I-92-216","author":"U. Wertz","year":"1992","unstructured":"Ulrich Wertz. First-order theorem proving modulo equations. Technical Report MPI-I-92-216, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany, April 1992."}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2014 CADE-15"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054257","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T23:22:11Z","timestamp":1676676131000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0054257"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540646754","9783540691105"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0054257","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"25 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}