{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:29:16Z","timestamp":1725568156271},"publisher-location":"Berlin, Heidelberg","reference-count":13,"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_20","type":"book-chapter","created":{"date-parts":[[2010,10,26]],"date-time":"2010-10-26T09:13:30Z","timestamp":1288084410000},"page":"258-273","source":"Crossref","is-referenced-by-count":2,"title":["Certifying Solutions to Permutation Group Problems"],"prefix":"10.1007","author":[{"given":"Arjeh","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott H.","family":"Murray","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Pollet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Volker","family":"Sorge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0012826","volume-title":"9th International Conference on Automated Deduction","author":"A. Bundy","year":"1988","unstructured":"Bundy, A.: The Use of Explicit Plans to Guide Inductive Proofs. In: Lusk, E., Overbeek, R. (eds.) CADE 1988. LNCS, vol.\u00a0310. Springer, Heidelberg (1988)"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Caprotti, O., Oostdijk, M.: Formal and efficient primality proofs by use of computer algebra oracles. J. of Symbolic Computation\u00a032(1\/2) (2001)","DOI":"10.1006\/jsco.2001.0457"},{"key":"20_CR3","unstructured":"Cohen, A., Murray, S.: An automated proof theory approach to computation with permutation groups. Tech. report, Dept. of Mathematics, TUEindhoven (2002)"},{"key":"20_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/3-540-45620-1_12","volume-title":"Automated Deduction - CADE-18","author":"J. Siekmann","year":"2002","unstructured":"Siekmann, J., et al.: Proof development with Omega. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol.\u00a02392, p. 144. Springer, Heidelberg (2002)"},{"key":"20_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/3-540-45744-5_33","volume-title":"Automated Reasoning","author":"A. Fiedler","year":"2001","unstructured":"Fiedler, A.: P.rex: An interactive proof explainer. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol.\u00a02083, p. 416. Springer, Heidelberg (2001)"},{"key":"20_CR6","unstructured":"The GAP Group, Aachen, St Andrews. GAP \u2013 Groups, Algorithms, and Programming, Version 4 (1998), http:\/\/www-gap.dcs.st-and.ac.uk\/~gap"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Harrison, J., Th\u00e9ry, L.: A Skeptic\u2019s Approach to Combining HOL and Maple. J. of Automated Reasoning\u00a021(3) (1998)","DOI":"10.1023\/A:1006023127567"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Kapur, D., Wang, D. (eds.): J. of Automated Reasoning\u2014 Special Issue on the Integration of Deduction and Symbolic Computation Systems\u00a021(3) (1998)","DOI":"10.1023\/A:1006075111638"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Kerber, M., Kohlhase, M., Sorge, V.: Integrating Computer Algebra Into Proof Planning. J. of Automated Reasoning\u00a021(3) (1998)","DOI":"10.1023\/A:1006059810729"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Kraan, I., Basin, D., Bundy, A.: Middle-Out Reasoning for Logic Program Synthesis. Technical Report MPI-I-93-214, Max-Planck-Institut, Germany (1993)","DOI":"10.1007\/978-1-4471-3560-9_1"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Meier, A., Pollet, M., Sorge, V.: Comparing Approaches to the Exploration of the Domain of Residue Classes. J. of Symbolic Computation\u00a034(4) (2002)","DOI":"10.1006\/jsco.2002.0550"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Melis, E., Siekmann, J.: Knowledge-Based Proof Planning. Artificial Intelligence\u00a0115(1) (1999)","DOI":"10.1016\/S0004-3702(99)00076-4"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/10720084_9","volume-title":"Frontiers of Combining Systems","author":"V. Sorge","year":"2000","unstructured":"Sorge, V.: Non-Trivial Symbolic Computations in Proof Planning. In: Kirchner, H. (ed.) FroCos 2000. LNCS, vol.\u00a01794. Springer, Heidelberg (2000)"}],"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_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,13]],"date-time":"2020-06-13T05:16:23Z","timestamp":1592025383000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45085-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405597","9783540450856"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45085-6_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}