{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:58:54Z","timestamp":1725562734432},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642152047"},{"type":"electronic","value":"9783642152054"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15205-4_15","type":"book-chapter","created":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T14:48:24Z","timestamp":1281710904000},"page":"155-169","source":"Crossref","is-referenced-by-count":9,"title":["Embedding Deduction Modulo into a Prover"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Burel","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/3-540-51081-8_97","volume-title":"Rewriting Techniques and Applications","author":"L. Bachmair","year":"1989","unstructured":"Bachmair, L.: Proof normalization for resolution and paramodulation. In: Dershowitz, N. (ed.) RTA 1989. LNCS, vol.\u00a0355, pp. 15\u201328. Springer, Heidelberg (1989)"},{"issue":"3","key":"15_CR2","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1093\/logcom\/4.3.217","volume":"4","author":"L. Bachmair","year":"1994","unstructured":"Bachmair, L., Ganzinger, H.: Rewrite-based equational theorem proving with selection and simplification. J. Log. Comput.\u00a04(3), 217\u2013247 (1994)","journal-title":"J. Log. Comput."},{"key":"15_CR3","series-title":"ACM International Conference Proceeding Series","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/1577824.1577838","volume-title":"LFMTP 2009","author":"G. Burel","year":"2009","unstructured":"Burel, G., Dowek, G.: How can we prove that a proof search method is not an instance of another? In: LFMTP 2009. ACM International Conference Proceeding Series, pp. 84\u201387. ACM, New York (2009)"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.ic.2009.10.005","volume":"208","author":"G. Burel","year":"2010","unstructured":"Burel, G., Kirchner, C.: Regaining cut admissibility in deduction modulo using abstract completion. Inform. Comput.\u00a0208, 140\u2013164 (2010)","journal-title":"Inform. Comput."},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/3-540-45841-7_3","volume-title":"STACS 2002","author":"G. Dowek","year":"2002","unstructured":"Dowek, G.: What is a theory? In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 50\u201364. Springer, Heidelberg (2002)"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-540-74464-1_8","volume-title":"Types for Proofs and Programs","author":"G. Dowek","year":"2007","unstructured":"Dowek, G.: Truth values algebras and proof normalization. In: Altenkirch, T., McBride, C. (eds.) TYPES 2006. LNCS, vol.\u00a04502, pp. 110\u2013124. Springer, Heidelberg (2007)"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Dowek, G.: Polarized resolution modulo (2010) (to be presented at IFIP TCS)","DOI":"10.1007\/978-3-642-15240-5_14"},{"issue":"1","key":"15_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0960129500003236","volume":"11","author":"G. Dowek","year":"2001","unstructured":"Dowek, G., Hardin, T., Kirchner, C.: HOL-\u03bb\u03c3 an intentional first-order expression of higher-order logic. Mathematical Structures in Computer Science\u00a011(1), 1\u201325 (2001)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"1","key":"15_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1023\/A:1027357912519","volume":"31","author":"G. Dowek","year":"2003","unstructured":"Dowek, G., Hardin, T., Kirchner, C.: Theorem proving modulo. Journal of Automated Reasoning\u00a031(1), 33\u201372 (2003)","journal-title":"Journal of Automated Reasoning"},{"key":"15_CR10","unstructured":"Dowek, G., Miquel, A.: Cut elimination for Zermelo\u2019s set theory (2006), available on authors\u2019 web page"},{"issue":"4","key":"15_CR11","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.2178\/jsl\/1067620188","volume":"68","author":"G. Dowek","year":"2003","unstructured":"Dowek, G., Werner, B.: Proof normalization modulo. The Journal of Symbolic Logic\u00a068(4), 1289\u20131316 (2003)","journal-title":"The Journal of Symbolic Logic"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/978-3-540-32033-3_31","volume-title":"Term Rewriting and Applications","author":"G. Dowek","year":"2005","unstructured":"Dowek, G., Werner, B.: Arithmetic as a theory modulo. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, pp. 423\u2013437. Springer, Heidelberg (2005)"},{"key":"15_CR13","unstructured":"Goubault-Larrecq, J.: A note on the completeness of certain refinements of resolution. Research Report LSV-02-8, Laboratoire Sp\u00e9cification et V\u00e9rification, ENS Cachan, France (2002)"},{"key":"15_CR14","unstructured":"Hermant, O.: M\u00e9thodes S\u00e9mantiques en D\u00e9duction Modulo. Ph.D. thesis, \u00c9cole Polytechnique (2005)"},{"issue":"3","key":"15_CR15","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10817-009-9153-6","volume":"44","author":"O. Hermant","year":"2009","unstructured":"Hermant, O.: Resolution is cut-free. Journal of Automated Reasoning\u00a044(3), 245\u2013276 (2009)","journal-title":"Journal of Automated Reasoning"},{"issue":"3","key":"15_CR16","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/321958.321960","volume":"23","author":"W.H. Joiner Jr.","year":"1976","unstructured":"Joiner Jr., W.H.: Resolution strategies as decision procedures. J. ACM\u00a023(3), 398\u2013417 (1976)","journal-title":"J. ACM"},{"key":"15_CR17","first-page":"73","volume-title":"Machine Intelligence","author":"G. Plotkin","year":"1972","unstructured":"Plotkin, G.: Building in equational theories. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence, vol.\u00a07, pp. 73\u201390. Edinburgh University Press, Edinburgh (1972)"},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-642-02959-2_8","volume-title":"Automated Deduction \u2013 CADE-22","author":"G. Sutcliffe","year":"2009","unstructured":"Sutcliffe, G., Benzm\u00fcller, C., Brown, C.E., Theiss, F.: Progress in the development of automated theorem proving for higher-order logic. In: Schmidt, R.A. (ed.) Automated Deduction \u2013 CADE-22. LNCS, vol.\u00a05663, pp. 116\u2013130. Springer, Heidelberg (2009)"},{"issue":"4","key":"15_CR19","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1145\/321296.321302","volume":"12","author":"L. Wos","year":"1965","unstructured":"Wos, L., Robinson, G.A., Carson, D.F.: Efficiency and completeness of the set of support strategy in theorem proving. J. ACM\u00a012(4), 536\u2013541 (1965)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15205-4_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:02:27Z","timestamp":1606186947000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15205-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152047","9783642152054"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15205-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}