{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T20:48:38Z","timestamp":1794343718894,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540482819","type":"print"},{"value":"9783540482826","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11916277_34","type":"book-chapter","created":{"date-parts":[[2006,10,17]],"date-time":"2006-10-17T14:32:59Z","timestamp":1161095579000},"page":"497-511","source":"Crossref","is-referenced-by-count":23,"title":["Theory Instantiation"],"prefix":"10.1007","author":[{"given":"Harald","family":"Ganzinger","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Konstantin","family":"Korovin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"34_CR1","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/S0890-5401(03)00020-8","volume":"183","author":"A. Armando","year":"2003","unstructured":"Armando, A., Ranise, S., Rusinowitch, M.: A Rewriting Approach to Satisfiability Procedures. Info. and Comp.\u00a0183(2), 140\u2013164 (2003)","journal-title":"Info. and Comp."},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/B978-044450813-3\/50010-2","volume-title":"Handbook of Automated Reasoning","author":"F. Baader","year":"2001","unstructured":"Baader, F., Snyder, W.: Unification theory. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol.\u00a0I, pp. 445\u2013532. Elsevier, Amsterdam (2001)"},{"key":"34_CR3","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.\u00a0I, pp. 19\u2013100. Elsevier, Amsterdam (2001)"},{"issue":"3\/4","key":"34_CR4","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"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Barrett, C., de Moura, L., Stump, A.: Design and results for the 1st satisfiability modulo theories competition. Journal of Automated Reasoning (to appear, 2006)","DOI":"10.1007\/11513988_4"},{"key":"34_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/10721959_16","volume-title":"Automated Deduction - CADE-17","author":"P. Baumgartner","year":"2000","unstructured":"Baumgartner, P.: FDPLL \u2013 a first-order Davis-Putnam-Logeman-Loveland Procedure. In: McAllester, D. (ed.) CADE 2000. LNCS, vol.\u00a01831, pp. 200\u2013219. Springer, Heidelberg (2000)"},{"key":"34_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-540-45085-6_32","volume-title":"Automated Deduction \u2013 CADE-19","author":"P. Baumgartner","year":"2003","unstructured":"Baumgartner, P., Tinelli, C.: The model evolution calculus. In: Baader, F. (ed.) CADE 2003. LNCS, vol.\u00a02741, pp. 350\u2013364. Springer, Heidelberg (2003)"},{"key":"34_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/11532231_29","volume-title":"Automated Deduction \u2013 CADE-20","author":"P. Baumgartner","year":"2005","unstructured":"Baumgartner, P., Tinelli, C.: The model evolution calculus with equality. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS, vol.\u00a03632, pp. 392\u2013408. Springer, Heidelberg (2005)"},{"key":"34_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BFb0013054","volume-title":"Logic Programming and Automated Reasoning","author":"P. Baumgartner","year":"1992","unstructured":"Baumgartner, P.: An order theory resolution calculus. In: Voronkov, A. (ed.) LPAR 1992. LNCS, vol.\u00a0624, pp. 119\u2013130. Springer, Heidelberg (1992)"},{"issue":"2,3","key":"34_CR10","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0304-3975(89)90004-2","volume":"67","author":"J. Gallier","year":"1989","unstructured":"Gallier, J., Snyder, W.: Complete sets of transformations for general E-unification. Theoretical Computer Science\u00a067(2,3), 203\u2013260 (1989)","journal-title":"Theoretical Computer Science"},{"key":"34_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-540-27813-9_14","volume-title":"Computer Aided Verification","author":"H. Ganzinger","year":"2004","unstructured":"Ganzinger, H., Hagen, G., Nieuwenhuis, R., Oliveras, A., Tinelli, C.: DPLL(T): Fast decision procedures. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol.\u00a03114, pp. 175\u2013188. Springer, Heidelberg (2004)"},{"key":"34_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-540-45085-6_15","volume-title":"Automated Deduction \u2013 CADE-19","author":"H. Ganzinger","year":"2003","unstructured":"Ganzinger, H., Hillenbrand, T., Waldmann, U.: Superposition modulo a shostak theory. In: Baader, F. (ed.) CADE 2003. LNCS, vol.\u00a02741, pp. 182\u2013196. Springer, Heidelberg (2003)"},{"key":"34_CR13","first-page":"55","volume-title":"Proc. 18th IEEE Symposium on LICS","author":"H. Ganzinger","year":"2003","unstructured":"Ganzinger, H., Korovin, K.: New directions in instantiation-based theorem proving. In: Proc. 18th IEEE Symposium on LICS, pp. 55\u201364. IEEE, Los Alamitos (2003)"},{"key":"34_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-540-30124-0_9","volume-title":"Computer Science Logic","author":"H. Ganzinger","year":"2004","unstructured":"Ganzinger, H., Korovin, K.: Integrating equational reasoning into instantiation-based theorem proving. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol.\u00a03210, pp. 71\u201384. Springer, Heidelberg (2004)"},{"key":"34_CR15","unstructured":"Ganzinger, H., Korovin, K.: Theory Instantiation (2006), Full version, Available at: http:\/\/www.cs.man.ac.uk\/~korovink\/"},{"key":"34_CR16","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1023\/A:1015854101244","volume":"28","author":"J. Hooker","year":"2002","unstructured":"Hooker, J., Rago, G., Chandru, V., Shrivastava, A.: Partial instantiation methods for inference in first order logic. J. of Automated Reasoning\u00a028, 371\u2013396 (2002)","journal-title":"J. of Automated Reasoning"},{"key":"34_CR17","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":"34_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/3-540-45653-8_10","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"R. Letz","year":"2001","unstructured":"Letz, R., Stenz, G.: Proof and model generation with disconnection tableaux. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS, vol.\u00a02250, pp. 142\u2013156. Springer, Heidelberg (2001)"},{"key":"34_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/3-540-45616-3_13","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"R. Letz","year":"2002","unstructured":"Letz, R., Stenz, G.: Integration of equality reasoning into the disconnection calculus. In: Egly, U., Ferm\u00fcller, C. (eds.) TABLEAUX 2002. LNCS, vol.\u00a02381, pp. 176\u2013190. Springer, Heidelberg (2002)"},{"key":"34_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/3-540-45127-7_18","volume-title":"Rewriting Techniques and Applications","author":"C. Lynch","year":"2001","unstructured":"Lynch, C., Morawska, B.: Goal-directed E-unification. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol.\u00a02051, pp. 231\u2013245. Springer, Heidelberg (2001)"},{"key":"34_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/3-540-59200-8_47","volume-title":"Rewriting Techniques and Applications","author":"R. Nieuwenhuis","year":"1995","unstructured":"Nieuwenhuis, R.: On narrowing, refutation proofs and constraints. In: Hsiang, J. (ed.) RTA 1995. LNCS, vol.\u00a0914, pp. 56\u201370. Springer, Heidelberg (1995)"},{"key":"34_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/11591191_3","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"R. Nieuwenhuis","year":"2005","unstructured":"Nieuwenhuis, R., Oliveras, A.: Decision Procedures for SAT, SAT Modulo Theories and Beyond. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS, vol.\u00a03835, pp. 23\u201346. Springer, Heidelberg (2005)"},{"key":"34_CR23","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)"},{"issue":"3","key":"34_CR24","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1023\/A:1006376231563","volume":"25","author":"D. Plaisted","year":"2000","unstructured":"Plaisted, D., Zhu, Y.: Ordered semantic hyper-linking. J. of Automated Reasoning\u00a025(3), 167\u2013217 (2000)","journal-title":"J. of Automated Reasoning"},{"issue":"4","key":"34_CR25","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/BF00244275","volume":"1","author":"M. Stickel","year":"1985","unstructured":"Stickel, M.: Automated deduction by theory resolution. J. Autom. Reasoning\u00a01(4), 333\u2013355 (1985)","journal-title":"J. Autom. Reasoning"},{"key":"34_CR26","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/3-540-45757-7_26","volume-title":"Logics in Artificial Intelligence","author":"C. Tinelli","year":"2002","unstructured":"Tinelli, C.: A DPLL-based calculus for ground satisfiability modulo theories. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol.\u00a02424, pp. 308\u2013319. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11916277_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,9]],"date-time":"2023-05-09T07:45:25Z","timestamp":1683618325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11916277_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540482819","9783540482826"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11916277_34","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11916277","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}