{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:25:58Z","timestamp":1725492358308},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540755586"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75560-9_39","type":"book-chapter","created":{"date-parts":[[2007,10,6]],"date-time":"2007-10-06T05:36:46Z","timestamp":1191649006000},"page":"546-560","source":"Crossref","is-referenced-by-count":3,"title":["ATP Cross-Verification of the Mizar MPTP Challenge Problems"],"prefix":"10.1007","author":[{"given":"Josef","family":"Urban","sequence":"first","affiliation":[]},{"given":"Geoff","family":"Sutcliffe","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"Theorem Proving in Higher Order Logics","year":"1999","unstructured":"Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C., Th\u00e9ry, L. (eds.): TPHOLs 1999. LNCS, vol.\u00a01690. Springer, Heidelberg (1999)"},{"key":"39_CR2","unstructured":"Claessen, K., Sorensson, N.: New Techniques that Improve MACE-style Finite Model Finding. In: Baumgartner, P., Fermueller, C. (eds.) Proceedings of the CADE-19 Workshop: Model Computation - Principles, Algorithms, Applications (2003)"},{"key":"39_CR3","unstructured":"Davis, M.: Obvious logical inferences. In: Hayes, P.J. (ed.) IJCAI, pp. 530\u2013531. William Kaufmann (1981)"},{"issue":"1","key":"39_CR4","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1142\/S0218213006002576","volume":"15","author":"E. Denney","year":"2006","unstructured":"Denney, E., Fischer, B., Schumann, J.: An empirical evaluation of automated theorem provers in software certification. International Journal on Artificial Intelligence Tools\u00a015(1), 81\u2013108 (2006)","journal-title":"International Journal on Artificial Intelligence Tools"},{"key":"39_CR5","series-title":"Lecture Notes in Artificial Intelligence","first-page":"17","volume-title":"Automated Reasoning","year":"2006","unstructured":"Furbach, U., Shankar, N. (eds.): IJCAR 2006. LNCS (LNAI), vol.\u00a04130, pp. 17\u201320. Springer, Heidelberg (2006)"},{"key":"39_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/978-3-540-30142-4_9","volume-title":"Theorem Proving in Higher Order Logics","author":"T.C. Hales","year":"2004","unstructured":"Hales, T.C.: Formalizing the proof of the kepler conjecture. In: Slind, K., Bunker, A., Gopalakrishnan, G.C. (eds.) TPHOLs 2004. LNCS, vol.\u00a03223, p. 117. Springer, Heidelberg (2004)"},{"key":"39_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BFb0105406","volume-title":"Theorem Proving in Higher Order Logics","author":"J. Harrison","year":"1996","unstructured":"Harrison, J.: A Mizar Mode for HOL. In: von Wright, J., Harrison, J., Grundy, J. (eds.) TPHOLs 1996. LNCS, vol.\u00a01125, pp. 203\u2013220. Springer, Heidelberg (1996)"},{"key":"39_CR8","unstructured":"Jaskowski, S.: On the rules of suppositions. Studia Logica 1 (1934)"},{"key":"39_CR9","doi-asserted-by":"crossref","unstructured":"McLaughlin, S.: An interpretation of Isabelle\/HOL in HOL Light. In: Furbach and Shankar [FS06], pp. 192\u2013204","DOI":"10.1007\/11814771_18"},{"key":"39_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/10721959_30","volume-title":"Automated Deduction - CADE-17","author":"W. McCune","year":"2000","unstructured":"McCune, W., Shumsky, O.: System description: IVY. In: McAllester, D. (ed.) Automated Deduction - CADE-17. LNCS, vol.\u00a01831, pp. 401\u2013405. Springer, Heidelberg (2000)"},{"key":"39_CR11","unstructured":"Naumowicz, A., Bylinski, C.: Basic elements of computer algebra in MIZAR. Mechanized Mathematics and Its Applications 2 (2002)"},{"key":"39_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/978-3-540-27818-4_21","volume-title":"Mathematical Knowledge Management","author":"A. Naumowicz","year":"2004","unstructured":"Naumowicz, A., Bylinski, C.: Improving mizar texts with properties and requirements. In: Asperti, A., Bancerek, G., Trybulec, A. (eds.) MKM 2004. LNCS, vol.\u00a03119, pp. 290\u2013301. Springer, Heidelberg (2004)"},{"key":"39_CR13","doi-asserted-by":"crossref","unstructured":"Obua, S., Skalberg, S.: Importing HOL into Isabelle\/HOL. In: Furbach and Shankar [FS06], pp. 298\u2013302","DOI":"10.1007\/11814771_27"},{"key":"39_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/014453499298165","volume":"20","author":"F.J. Pelletier","year":"1999","unstructured":"Pelletier, F.J.: A brief history of natural deduction. History and Philosophy of Logic\u00a020, 1\u201331 (1999)","journal-title":"History and Philosophy of Logic"},{"issue":"3-4","key":"39_CR15","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1023\/A:1006218513245","volume":"23","author":"P. Rudnicki","year":"1999","unstructured":"Rudnicki, P., Trybulec, A.: On equivalents of well-foundedness. J. Autom. Reasoning\u00a023(3-4), 197\u2013234 (1999)","journal-title":"J. Autom. Reasoning"},{"issue":"4","key":"39_CR16","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/BF00247436","volume":"3","author":"P. Rudnicki","year":"1987","unstructured":"Rudnicki, P.: Obvious inferences. J. Autom. Reasoning\u00a03(4), 383\u2013393 (1987)","journal-title":"J. Autom. Reasoning"},{"key":"39_CR17","unstructured":"Rudnicki, P.: An overview of the Mizar project. In: 1992 Workshop on Types for Proofs and Programs, Chalmers University of Technology, Bastad, pp. 311\u2013332 (1992)"},{"issue":"2-3","key":"39_CR18","first-page":"91","volume":"15","author":"A. Riazanov","year":"2002","unstructured":"Riazanov, A., Voronkov, A.: The design and implementation of VAMPIRE. Journal of AI Communications\u00a015(2-3), 91\u2013110 (2002)","journal-title":"Journal of AI Communications"},{"issue":"2-3","key":"39_CR19","first-page":"111","volume":"15","author":"S. Schulz","year":"2002","unstructured":"Schulz, S.: E \u2013 a brainiac theorem prover. Journal of AI Communications\u00a015(2-3), 111\u2013126 (2002)","journal-title":"Journal of AI Communications"},{"issue":"2","key":"39_CR20","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1023\/A:1005806324129","volume":"21","author":"G. Sutcliffe","year":"1998","unstructured":"Sutcliffe, G., Suttner, C.B.: The TPTP problem library: CNF release v1.2.1. Journal of Automated Reasoning\u00a021(2), 177\u2013203 (1998)","journal-title":"Journal of Automated Reasoning"},{"issue":"6","key":"39_CR21","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1142\/S0218213006003119","volume":"15","author":"G. Sutcliffe","year":"2006","unstructured":"Sutcliffe, G.: Semantic Derivation Verification. International Journal on Artificial Intelligence Tools\u00a015(6), 1053\u20131070 (2006)","journal-title":"International Journal on Artificial Intelligence Tools"},{"key":"39_CR22","doi-asserted-by":"crossref","unstructured":"Syme, D.: Three tactic theorem proving. In: Bertot et\u00a0al. [BDH+99], pp. 203\u2013220","DOI":"10.1007\/3-540-48256-3_14"},{"key":"39_CR23","series-title":"Frontiers in Artificial Intelligence and Applications","volume-title":"Distributed and Multi-Agent Reasoning","author":"G. Sutcliffe","year":"2004","unstructured":"Sutcliffe, G., Zimmer, J., Schulz, S.: TSTP Data-Exchange Formats for Automated Theorem Proving Tools. In: Sorge, V., Zhang, W. (eds.) Distributed and Multi-Agent Reasoning. Frontiers in Artificial Intelligence and Applications, IOS Press, Amsterdam (2004)"},{"issue":"3-4","key":"39_CR24","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10817-004-6245-1","volume":"33","author":"J. Urban","year":"2004","unstructured":"Urban, J.: MPTP - motivation, implementation, first experiments. Journal of Automated Reasoning\u00a033(3-4), 319\u2013339 (2004)","journal-title":"Journal of Automated Reasoning"},{"issue":"1-2","key":"39_CR25","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10817-006-9032-3","volume":"37","author":"J. Urban","year":"2006","unstructured":"Urban, J.: MPTP 0.2: Design, implementation, and initial experiments. J. Autom. Reasoning\u00a037(1-2), 21\u201343 (2006)","journal-title":"J. Autom. Reasoning"},{"key":"39_CR26","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/11618027_23","volume-title":"Mathematical Knowledge Management","author":"J. Urban","year":"2006","unstructured":"Urban, J.: XML-izing Mizar: making semantic processing and presentation of MML easy. In: Kohlhase, M. (ed.) MKM 2005. LNCS (LNAI), vol.\u00a03863, pp. 346\u2013360. Springer, Heidelberg (2006)"},{"key":"39_CR27","unstructured":"Urban, J.: MaLARea: a metasystem for automated reasoning in large theories. In: Sutcliffe, G., Urban, J., Schulz, S. (eds.) ESARLT: Empirically Successful Automated Reasoning in Large Theories. CEUR Workshop Proceedings. CEUR, vol.\u00a0257, pp. 45\u201358 (2007)"},{"key":"39_CR28","unstructured":"Urban, J., Trac, S., Sutcliffe, G., Puzis, Y.: Combining Mizar and TPTP semantic presentation tools. In: Proceedings of the Mathematical User-Interfaces Workshop 2007 (2007), http:\/\/www.activemath.org\/workshops\/MathUI\/07\/proceedings\/Urban-etal-MizarIDV.html"},{"key":"39_CR29","doi-asserted-by":"crossref","unstructured":"Weidenbach, C., Brahm, U., Hillenbrand, T., Keen, E., Theobald, C., Topic, D.: SPASS version 2.0. In: CADE, pp. 275\u2013279 (2002)","DOI":"10.1007\/3-540-45620-1_22"},{"key":"39_CR30","doi-asserted-by":"crossref","unstructured":"Wenzel, M.: Isar - a generic interpretative approach to readable formal proof documents. In: Bertot et\u00a0al. [BDH+99], pp. 167\u2013184","DOI":"10.1007\/3-540-48256-3_12"},{"key":"39_CR31","unstructured":"Wiedijk, F.: CHECKER - notes on the basic inference step in Mizar (2000), available at http:\/\/www.cs.kun.nl\/~freek\/mizar\/by.dvi"},{"key":"39_CR32","doi-asserted-by":"crossref","unstructured":"Zammit, V.: On the implementation of an extensible declarative proof language. In: Bertot et\u00a0al. [BDH+99], pp. 185\u2013202","DOI":"10.1007\/3-540-48256-3_13"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75560-9_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:24:47Z","timestamp":1619519087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75560-9_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540755586"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75560-9_39","relation":{},"subject":[]}}