{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T02:45:58Z","timestamp":1767926758730,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540749141","type":"print"},{"value":"9783540749158","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74915-8_19","type":"book-chapter","created":{"date-parts":[[2007,8,24]],"date-time":"2007-08-24T05:13:35Z","timestamp":1187932415000},"page":"223-237","source":"Crossref","is-referenced-by-count":40,"title":["Integrating Linear Arithmetic into Superposition Calculus"],"prefix":"10.1007","author":[{"given":"Konstantin","family":"Korovin","sequence":"first","affiliation":[]},{"given":"Andrei","family":"Voronkov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","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":"19_CR2","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/B978-044450813-3\/50004-7","volume-title":"Handbook of Automated Reasoning","author":"L. Bachmair","year":"2001","unstructured":"Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol.\u00a01, pp. 19\u2013100. Elsevier, Amsterdam (2001)"},{"issue":"3\/4","key":"19_CR3","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01190829","volume":"5","author":"L. Bachmair","year":"1994","unstructured":"Bachmair, L., Ganzinger, H., Waldmann, U.: Refutational Theorem Proving for Hierarchic First-Order Theories. Applicable Algebra in Engineering, Communication and Computing\u00a05(3\/4), 193\u2013212 (1994)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"issue":"1","key":"19_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0747-7171(03)00070-1","volume":"37","author":"G. Godoy","year":"2004","unstructured":"Godoy, G., Nieuwenhuis, R.: Superposition with completely built-in Abelian groups. J. Symb. Comput.\u00a037(1), 1\u201333 (2004)","journal-title":"J. Symb. Comput."},{"key":"19_CR5","unstructured":"Hustadt, U., Motik, B., Sattler, U.: Reasoning in description logics with a concrete domain in the framework of resolution. In: ECAI, pp. 353\u2013357 (2004)"},{"key":"19_CR6","unstructured":"Korovin, K., Voronkov, A.: Integrating linear arithmetic into superposition calculus. Journal version (in preparation)"},{"key":"19_CR7","volume-title":"Research Notes in Theoretical Computer Science","author":"P. Chenadec Le","year":"1986","unstructured":"Le Chenadec, P.: Canonical forms in finitely presented algebras. In: Research Notes in Theoretical Computer Science, Wiley, Chichester (1986)"},{"issue":"3","key":"19_CR8","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. J. Symb. Comput.\u00a021(3), 253\u2013288 (1996)","journal-title":"J. Symb. Comput."},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/B978-044450813-3\/50009-6","volume-title":"Handbook of Automated Reasoning","author":"R. Nieuwenhuis","year":"2001","unstructured":"Nieuwenhuis, R., Rubio, A.: Paramodulation-based theorem proving. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol.\u00a0I, pp. 371\u2013443. Elsevier, Amsterdam (2001)"},{"key":"19_CR10","volume-title":"Theory of recursive functions and effective computability","author":"H. Rogers","year":"1988","unstructured":"Rogers, H.: Theory of recursive functions and effective computability. MIT Press, Cambridge (1988)"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/3-540-56868-9_28","volume-title":"Rewriting Techniques and Applications","author":"A. Rubio","year":"1993","unstructured":"Rubio, A., Nieuwenhuis, R.: A precedence-based total AC-compatible ordering. In: Kirchner, C. (ed.) Rewriting Techniques and Applications. LNCS, vol.\u00a0690, pp. 374\u2013388. Springer, Heidelberg (1993)"},{"issue":"1-2","key":"19_CR12","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0304-3975(98)00082-6","volume":"208","author":"J. Stuber","year":"1998","unstructured":"Stuber, J.: Superposition theorem proving for Abelian groups represented as integer modules. Theor. Comput. Sci.\u00a0208(1-2), 149\u2013177 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Waldmann, U.: Superposition and chaining for totally ordered divisible Abelian groups. In: International Joint Conference for Automated Reasoning, pp. 226\u2013241 (2001)","DOI":"10.1007\/3-540-45744-5_17"},{"issue":"6","key":"19_CR14","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1006\/jsco.2002.0536","volume":"33","author":"U. Waldmann","year":"2002","unstructured":"Waldmann, U.: Cancellative Abelian monoids and related structures in refutational theorem proving (part I, II). Journal of Symbolic Computation\u00a033(6), 777\u2013829 (2002)","journal-title":"Journal of Symbolic Computation"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74915-8_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:45:47Z","timestamp":1619520347000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74915-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749141","9783540749158"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74915-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}