{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:50:04Z","timestamp":1725475804521},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540676645"},{"type":"electronic","value":"9783540451013"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10721959_37","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T21:12:31Z","timestamp":1167426751000},"page":"460-464","source":"Crossref","is-referenced-by-count":19,"title":["System Description: Tramp: Transformation of Machine-Found Proofs into Natural Deduction Proofs at the Assertion Level"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Meier","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","unstructured":"POST (1999), See at http:\/\/www.ags.uni-sb.de\/~omega\/primer\/post.html"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"Andrews, P.B.: Transforming matings into natural deduction proofs. In: Proc. of CADE-5, pp. 281\u2013292 (1980)","DOI":"10.1007\/3-540-10009-1_22"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"Benzm\u00fcller, C., et al.: \u03a9mega: Towards a mathematical assistant. In: Proc. of CADE-14, pp. 252\u2013255 (1997)","DOI":"10.1007\/3-540-63104-6_23"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Benzm\u00fcller, C., Kohlhase, M.: LEO, a higher order theorem prover. In: Proc. of CADE-15, pp. 139\u2013144 (1998)","DOI":"10.1007\/BFb0054256"},{"key":"37_CR5","unstructured":"Eisinger, N.: Completeness, confluence, and related properties of clause graph resolution. PhD thesis, Universit\u00e4t Kaiserslautern, Germany (1988)"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Franke, A., Kohlhase, M.: MATHWEB, an agent-based communication layer for distributed automated theorem proving. In: Proc. CADE-16, pp. 217\u2013221 (1999)","DOI":"10.1007\/3-540-48660-7_17"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Horacek, H.: Presenting proofs in a human-oriented way. In: Proc. of CADE-16, pp. 142\u2013156 (1999)","DOI":"10.1007\/3-540-48660-7_10"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Huang, X.: Reconstructing proofs at the assertion level. In: Proc. of CADE-12, pp. 738\u2013752 (1994)","DOI":"10.1007\/3-540-58156-1_53"},{"key":"37_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/3-540-61532-6_34","volume-title":"PRICAI 1996: Topics in Artificial Intelligence","author":"X. Huang","year":"1996","unstructured":"Huang, X.: Translating machine-generated resolution proofs into ND-proofs at the assertion level. In: Foo, N.Y., G\u00f6bel, R. (eds.) PRICAI 1996. LNCS, vol.\u00a01114, pp. 399\u2013410. Springer, Heidelberg (1996)"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Huang, X., Fiedler, A.: Presenting machine-found proofs. In: Proc. of CADE-13, pp. 221\u2013225 (1996)","DOI":"10.1007\/3-540-61511-3_83"},{"key":"37_CR11","unstructured":"Meier, A.: Transformation of machine-found proofs into assertion level proofs. Technical report (2000), Available at http:\/\/www.ags.uni-sb.de\/~ameier\/tramp.html"},{"key":"37_CR12","unstructured":"Pfenning, F.: Proof transformation in higher-order logic. PhD thesis, CMU, Pittsburgh, Pennsylvania, USA (1987)"},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"Sutcliffe, G., et al.: The TPTP problem library. In: Proc. of CADE-12, pp. 252\u2013266 (1994)","DOI":"10.1007\/3-540-58156-1_18"},{"issue":"2","key":"37_CR14","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1023\/A:1005820421829","volume":"18","author":"G. Sutcliffe","year":"1997","unstructured":"Sutcliffe, G., Suttner, C.: The results of the CADE-13 ATP system competition. Journal of Automated Reasoning\u00a018(2), 259\u2013264 (1997)","journal-title":"Journal of Automated Reasoning"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction - CADE-17"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10721959_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T11:42:50Z","timestamp":1556019770000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10721959_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676645","9783540451013"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/10721959_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}