| A formal proof of the Kepler conjecture T Hales, M Adams, G Bauer, TD Dang, J Harrison, H Le Truong, ... Forum of mathematics, Pi 5, e2, 2017 | 363 | 2017 |
| Hammering towards QED JC Blanchette, C Kaliszyk, LC Paulson, J Urban Journal of Formalized Reasoning 9 (1), 101-148, 2016 | 190 | 2016 |
| Learning-assisted automated reasoning with Flyspeck C Kaliszyk, J Urban Journal of Automated Reasoning 53, 173-213, 2014 | 183 | 2014 |
| Deep network guided proof search S Loos, G Irving, C Szegedy, C Kaliszyk arXiv preprint arXiv:1701.06972, 2017 | 167 | 2017 |
| Reinforcement learning of theorem proving C Kaliszyk, J Urban, H Michalewski, M Olšák Advances in Neural Information Processing Systems 31, 2018 | 146 | 2018 |
| Mizar 40 for mizar 40 C Kaliszyk, J Urban Journal of Automated Reasoning 55 (3), 245-256, 2015 | 146 | 2015 |
| Hammer for Coq: Automation for dependent type theory Ł Czajka, C Kaliszyk Journal of automated reasoning 61, 423-453, 2018 | 111 | 2018 |
| HOL(y)Hammer: Online ATP Service for HOL Light C Kaliszyk, J Urban Mathematics in Computer Science 9, 5-22, 2015 | 109 | 2015 |
| Learning to Reason with HOL4 tactics T Gauthier, C Kaliszyk, J Urban arXiv preprint arXiv:1804.00595, 2018 | 99* | 2018 |
| MaSh: machine learning for Sledgehammer D Kühlwein, JC Blanchette, C Kaliszyk, J Urban Interactive Theorem Proving: 4th International Conference, ITP 2013, Rennes …, 2013 | 99 | 2013 |
| Holstep: A machine learning dataset for higher-order logic theorem proving C Kaliszyk, F Chollet, C Szegedy arXiv preprint arXiv:1703.00426, 2017 | 80 | 2017 |
| FEMaLeCoP: Fairly efficient machine learning connection prover C Kaliszyk, J Urban Logic for Programming, Artificial Intelligence, and Reasoning: 20th …, 2015 | 69 | 2015 |
| A learning-based fact selector for Isabelle/HOL JC Blanchette, D Greenaway, C Kaliszyk, D Kühlwein, J Urban Journal of Automated Reasoning 57, 219-244, 2016 | 67 | 2016 |
| Efficient semantic features for automated reasoning over large theories C Kaliszyk, J Urban, J Vyskocil Palo Alto: AAAI Press, 2015 | 67 | 2015 |
| General bindings and alpha-equivalence in Nominal Isabelle C Urban, C Kaliszyk Logical methods in computer science 8, 2012 | 59 | 2012 |
| Learning-assisted theorem proving with millions of lemmas C Kaliszyk, J Urban Journal of symbolic computation 69, 109-128, 2015 | 56 | 2015 |
| Scalable LCF-style proof translation C Kaliszyk, A Krauss Interactive Theorem Proving: 4th International Conference, ITP 2013, Rennes …, 2013 | 48 | 2013 |
| Web interfaces for proof assistants C Kaliszyk Electronic Notes in Theoretical Computer Science 174 (2), 49-61, 2007 | 48 | 2007 |
| Premise selection and external provers for HOL4 T Gauthier, C Kaliszyk Proceedings of the 2015 Conference on Certified Programs and Proofs, 49-57, 2015 | 46 | 2015 |
| Teaching logic using a state-of-the-art proof assistant M Hendriks, C Kaliszyk, F Raamsdonk, F Wiedijk | 44 | 2010 |
Josef UrbanDistinguished Researcher at Czech Technical University in PragueVerified email at cvut.cz
