{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T18:20:59Z","timestamp":1747592459938},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405597"},{"type":"electronic","value":"9783540450856"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45085-6_37","type":"book-chapter","created":{"date-parts":[[2010,10,26]],"date-time":"2010-10-26T13:13:30Z","timestamp":1288098810000},"page":"427-441","source":"Crossref","is-referenced-by-count":1,"title":["Schematic Saturation for Decision and Unification Problems"],"prefix":"10.1007","author":[{"given":"Christopher","family":"Lynch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/3-540-44802-0_36","volume-title":"Computer Science Logic","author":"A. Armando","year":"2001","unstructured":"Armando, A., Ranise, S., Rusinowitch, M.: Uniform Derivation of Decision Procedures by Superposition. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol.\u00a02142, pp. 513\u2013527. Springer, Heidelberg (2001)"},{"key":"37_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, pp. 19\u201399. North Holland, Amsterdam (2001)"},{"issue":"1","key":"37_CR3","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1145\/363647.363681","volume":"48","author":"D. Basin","year":"2001","unstructured":"Basin, D., Ganzinger, H.: Automated complexity analysis based on ordered resolution. J. Association for Computing Machinery\u00a048(1), 70\u2013109 (2001)","journal-title":"J. Association for Computing Machinery"},{"key":"37_CR4","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","volume":"3","author":"W. Dowling","year":"1984","unstructured":"Dowling, W., Gallier, J.: Linear-time algorithms for testing the satisfiability of propositional horn formulae. Journal of Logic Programming\u00a03, 267\u2013284 (1984)","journal-title":"Journal of Logic Programming"},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"Ganzinger, H.: Relating Semantic and Proof-Theoretic Concepts for Polynomial Time Decidability of Uniform Word Problems. In: Proceedings 16th IEEE Symposium on Logic in Computer Science, LICS 2001, Boston (2001)","DOI":"10.1109\/LICS.2001.932485"},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1109\/LICS.2002.1029813","volume-title":"Proceedings 17th IEEE Symposium on Logic in Computer Science, LICS 2002","author":"C. Lynch","year":"2002","unstructured":"Lynch, C., Morawska, B.: Automatic Decidability. In: Proceedings 17th IEEE Symposium on Logic in Computer Science, LICS 2002, pp. 7\u201316. IEEE Computer Society Press, Los Alamitos (2002)"},{"issue":"2","key":"37_CR7","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1145\/151261.151265","volume":"40","author":"D. McAllester","year":"1993","unstructured":"McAllester, D.: Automated Recognition of Tractability in Inference Relations. Journal of the ACM\u00a040(2), 284\u2013303 (1993)","journal-title":"Journal of the ACM"},{"key":"37_CR8","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1109\/LICS.1996.561464","volume-title":"Proceedings 11th IEEE Symposium on Logic in Computer Science, LICS 1996","author":"R. Nieuwenhuis","year":"1996","unstructured":"Nieuwenhuis, R.: Basic paramodulation and decidable theories (Extended abstract). In: Proceedings 11th IEEE Symposium on Logic in Computer Science, LICS 1996, pp. 473\u2013482. IEEE Computer Society Press, Los Alamitos (1996)"},{"key":"37_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/LICS.2002.1029812","volume-title":"Proceedings 17th IEEE Symposium on Logic in Computer Science, LICS 2002","author":"N. Shankar","year":"2002","unstructured":"Shankar, N.: Little Engines of Proof. In: Proceedings 17th IEEE Symposium on Logic in Computer Science, LICS 2002, p. 3. IEEE Computer Society Press, Los Alamitos (2002)"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE-19"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45085-6_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,6]],"date-time":"2018-10-06T11:59:12Z","timestamp":1538827152000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45085-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405597","9783540450856"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45085-6_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}