| 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, 2017 | 237 | 2017 |
| Learning-assisted automated reasoning with Flyspeck C Kaliszyk, J Urban Journal of Automated Reasoning 53 (2), 173-213, 2014 | 157 | 2014 |
| Hammering towards QED JC Blanchette, C Kaliszyk, LC Paulson, J Urban Journal of Formalized Reasoning 9 (1), 101-148, 2016 | 135 | 2016 |
| Deep network guided proof search S Loos, G Irving, C Szegedy, C Kaliszyk arXiv preprint arXiv:1701.06972, 2017 | 116 | 2017 |
| Mizar 40 for mizar 40 C Kaliszyk, J Urban Journal of Automated Reasoning 55 (3), 245-256, 2015 | 109 | 2015 |
| MaSh: machine learning for Sledgehammer D Kühlwein, JC Blanchette, C Kaliszyk, J Urban International Conference on Interactive Theorem Proving, 35-50, 2013 | 88 | 2013 |
| HOL (y) Hammer: Online ATP service for HOL Light C Kaliszyk, J Urban Mathematics in Computer Science 9 (1), 5-22, 2015 | 81 | 2015 |
| Reinforcement learning of theorem proving C Kaliszyk, J Urban, H Michalewski, M Olšák arXiv preprint arXiv:1805.07563, 2018 | 73 | 2018 |
| General bindings and alpha-equivalence in Nominal Isabelle C Urban, C Kaliszyk European Symposium on Programming, 480-500, 2011 | 72 | 2011 |
| General bindings and alpha-equivalence in Nominal Isabelle C Urban, C Kaliszyk European Symposium on Programming, 480-500, 2011 | 72 | 2011 |
| Learning to Reason with HOL4 tactics T Gauthier, C Kaliszyk, J Urban arXiv preprint arXiv:1804.00595, 2018 | 69* | 2018 |
| Hammer for Coq: automation for dependent type theory Ł Czajka, C Kaliszyk Journal of automated reasoning 61 (1), 423-453, 2018 | 64 | 2018 |
| A learning-based fact selector for Isabelle/HOL JC Blanchette, D Greenaway, C Kaliszyk, D Kühlwein, J Urban Journal of Automated Reasoning 57 (3), 219-244, 2016 | 58 | 2016 |
| FEMaLeCoP: Fairly efficient machine learning connection prover C Kaliszyk, J Urban Logic for Programming, Artificial Intelligence, and Reasoning, 88-96, 2015 | 58 | 2015 |
| Holstep: A machine learning dataset for higher-order logic theorem proving C Kaliszyk, F Chollet, C Szegedy arXiv preprint arXiv:1703.00426, 2017 | 57 | 2017 |
| Efficient semantic features for automated reasoning over large theories C Kaliszyk, J Urban, J Vyskocil Palo Alto: AAAI Press, 2015 | 51 | 2015 |
| Learning-assisted theorem proving with millions of lemmas C Kaliszyk, J Urban Journal of symbolic computation 69, 109-128, 2015 | 48 | 2015 |
| Scalable LCF-style proof translation C Kaliszyk, A Krauss International Conference on Interactive Theorem Proving, 51-66, 2013 | 47 | 2013 |
| Web interfaces for proof assistants C Kaliszyk Electronic Notes in Theoretical Computer Science 174 (2), 49-61, 2007 | 44 | 2007 |
| Certified computer algebra on top of an interactive theorem prover C Kaliszyk, F Wiedijk Towards Mechanized Mathematical Assistants, 94-105, 2007 | 40 | 2007 |
Josef UrbanPrincipal Researcher at Czech Technical University in PragueVerified email at cvut.cz
