{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:49:01Z","timestamp":1725558541312},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141270"},{"type":"electronic","value":"9783642141287"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14128-7_4","type":"book-chapter","created":{"date-parts":[[2010,6,29]],"date-time":"2010-06-29T10:45:36Z","timestamp":1277808336000},"page":"19-33","source":"Crossref","is-referenced-by-count":1,"title":["I-Terms in Ordered Resolution and Superposition Calculi: Retrieving Lost Completeness"],"prefix":"10.1007","author":[{"given":"Hicham","family":"Bensaid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Caferra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Peltier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"4_CR1","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1093\/logcom\/4.3.217","volume":"3","author":"L. Bachmair","year":"1994","unstructured":"Bachmair, L., Ganzinger, H.: Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation\u00a03(4), 217\u2013247 (1994)","journal-title":"Journal of Logic and Computation"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Robinson and Voronkov [19], pp. 19\u201399","DOI":"10.1016\/B978-044450813-3\/50004-7"},{"key":"4_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/3-540-69778-0_14","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"P. Baumgartner","year":"1998","unstructured":"Baumgartner, P.: Hyper Tableaux \u2014 The Next Generation. In: de Swart, H. (ed.) TABLEAUX 1998. LNCS (LNAI), vol.\u00a01397, pp. 60\u201376. Springer, Heidelberg (1998)"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-540-73445-1_4","volume-title":"Logic, Language, Information and Computation","author":"H. Bensaid","year":"2007","unstructured":"Bensaid, H., Caferra, R., Peltier, N.: Towards systematic analysis of theorem provers search spaces: First steps. In: Leivant, D., de Queiroz, R. (eds.) WoLLIC 2007. LNCS, vol.\u00a04576, pp. 38\u201352. Springer, Heidelberg (2007)"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-642-02959-2_11","volume-title":"Automated Deduction \u2013 CADE-22","author":"H. Bensaid","year":"2009","unstructured":"Bensaid, H., Caferra, R., Peltier, N.: Dei: A theorem prover for terms with integer exponents. In: Schmidt, R.A. (ed.) Automated Deduction \u2013 CADE-22. LNCS, vol.\u00a05663, pp. 146\u2013150. Springer, Heidelberg (2009)"},{"key":"4_CR6","series-title":"Applied Logic Series","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4020-2653-9","volume-title":"Automated Model Building","author":"R. Caferra","year":"2004","unstructured":"Caferra, R., Leitsch, A., Peltier, N.: Automated Model Building. Applied Logic Series, vol.\u00a031. Kluwer Academic Publishers, Dordrecht (2004)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/3-540-54303-1","volume-title":"Conditional and Typed Rewriting Systems","author":"H. Chen","year":"1991","unstructured":"Chen, H., Hsiang, J., Kong, H.-C.: On finite representations of infinite sequences of terms. In: Okada, M., Kaplan, S. (eds.) CTRS 1990. LNCS, vol.\u00a0516, pp. 100\u2013114. Springer, Heidelberg (1991)"},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF01294596","volume":"28","author":"H. Comon","year":"1995","unstructured":"Comon, H.: On unification of terms with integer exponents. Mathematical Systems Theory\u00a028(1), 67\u201388 (1995)","journal-title":"Mathematical Systems Theory"},{"issue":"2","key":"4_CR9","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0168-0072(88)90015-2","volume":"39","author":"W.M. Farmer","year":"1988","unstructured":"Farmer, W.M.: A unification algorithm for second-order monadic terms. Annals of Pure and Applied Logic\u00a039(2), 131\u2013174 (1988)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"1-2","key":"4_CR10","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0304-3975(96)00052-7","volume":"176","author":"M. Hermann","year":"1997","unstructured":"Hermann, M., Galbav\u00fd, R.: Unification of infinite sets of terms schematized by primal grammars. Theor. Comput. Sci.\u00a0176(1-2), 111\u2013158 (1997)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"4_CR11","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10817-009-9153-6","volume":"44","author":"O. Hermant","year":"2010","unstructured":"Hermant, O.: Resolution is cut-free. Journal of Automated Reasoning\u00a044(3), 245\u2013276 (2010)","journal-title":"Journal of Automated Reasoning"},{"issue":"2-3","key":"4_CR12","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0304-3975(89)90007-8","volume":"67","author":"H. Kirchner","year":"1989","unstructured":"Kirchner, H.: Schematization of infinite sets of rewrite rules generated by divergent completion processes. Theoretical Comput. Sci.\u00a067(2-3), 303\u2013332 (1989)","journal-title":"Theoretical Comput. Sci."},{"key":"4_CR13","volume-title":"Texts in Theoretical Computer Science","author":"A. Leitsch","year":"1997","unstructured":"Leitsch, A.: The resolution calculus. In: Texts in Theoretical Computer Science. Springer, Heidelberg (1997)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Nieuwenhuis, R., Rubio, A.: Paramodulation-based theorem proving. In: Robinson and Voronkov [19], pp. 371\u2013443","DOI":"10.1016\/B978-044450813-3\/50009-6"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1006\/jsco.1997.0114","volume":"24","author":"N. Peltier","year":"1997","unstructured":"Peltier, N.: Increasing the capabilities of model building by constraint solving with terms with integer exponents. Journal of Symbolic Computation\u00a024, 59\u2013101 (1997)","journal-title":"Journal of Symbolic Computation"},{"key":"4_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1007\/3-540-45744-5_48","volume-title":"Automated Reasoning","author":"N. Peltier","year":"2001","unstructured":"Peltier, N.: A General Method for Using Terms Schematizations in Automated Deduction. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol.\u00a02083, pp. 578\u2013593. Springer, Heidelberg (2001)"},{"key":"4_CR17","first-page":"227","volume":"1","author":"J.A. Robinson","year":"1965","unstructured":"Robinson, J.A.: Automatic deduction with hyperresolution. Intern. Journal of Computer Math.\u00a01, 227\u2013234 (1965)","journal-title":"Intern. Journal of Computer Math."},{"key":"4_CR18","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J.A. Robinson","year":"1965","unstructured":"Robinson, J.A.: A machine-oriented logic based on the resolution principle. J. Assoc. Comput. Mach.\u00a012, 23\u201341 (1965)","journal-title":"J. Assoc. Comput. Mach."},{"key":"4_CR19","unstructured":"Robinson, J.A., Voronkov, A. (eds.): Handbook of Automated Reasoning, vol. 2. Elsevier\/MIT Press (2001)"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/BFb0013079","volume-title":"Logic Programming and Automated Reasoning","author":"G. Salzer","year":"1992","unstructured":"Salzer, G.: The unification of infinite sets of terms and its applications. In: Voronkov, A. (ed.) LPAR 1992. LNCS, vol.\u00a0624, pp. 409\u2013420. Springer, Heidelberg (1992)"},{"key":"4_CR21","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/978-3-540-25984-8_15","volume-title":"Automated Reasoning","author":"S. Schulz","year":"2004","unstructured":"Schulz, S.: System Description: E\u00a00.81. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol.\u00a03097, pp. 223\u2013228. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computer Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14128-7_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:19:14Z","timestamp":1619785154000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14128-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141270","9783642141287"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14128-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}