Miroslav Olsák

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 35

Top Topics

Theorem Proving

Automated Reasoning

Constraint Satisfaction

Top Venues

Publications

Jason Rute, Miroslav Olsák, Lasse Blaauwbroek, Fidel Ivan Schaposnik Massolo, Jelle Piepenbrock, Vasily Pestun
Graph2Tac: Learning Hierarchical Representations of Math Concepts in Theorem proving. CoRR (2024)
Lasse Blaauwbroek, Miroslav Olsák, Herman Geuvers
Hashing Modulo Context-Sensitive α-Equivalence. CoRR (2024)
Lasse Blaauwbroek, Miroslav Olsák, Herman Geuvers
Hashing Modulo Context-Sensitive 𝛼-Equivalence. Proc. ACM Program. Lang. 8 (PLDI) (2024)
Thibault Gauthier, Miroslav Olsák, Josef Urban
Alien coding. Int. J. Approx. Reason. 162 (2023)
Thibault Gauthier, Miroslav Olsák, Josef Urban
Alien Coding. CoRR (2023)
Zarathustra Amadeus Goertzel, Jan Jakubuv, Cezary Kaliszyk, Miroslav Olsák, Jelle Piepenbrock, Josef Urban
The Isabelle ENIGMA. ITP (2022)
Zarathustra Amadeus Goertzel, Jan Jakubuv, Cezary Kaliszyk, Miroslav Olsák, Jelle Piepenbrock, Josef Urban
The Isabelle ENIGMA. CoRR (2022)
Jelle Piepenbrock, Josef Urban, Konstantin Korovin, Miroslav Olsák, Tom Heskes, Mikolas Janota
Machine Learning Meets The Herbrand Universe. CoRR (2022)
Zsolt Zombori, Josef Urban, Miroslav Olsák
The Role of Entropy in Guiding a Connection Prover. CoRR (2021)
Marco Bagatella, Miroslav Olsák, Michal Rolínek, Georg Martius
Planning from Pixels in Environments with Combinatorially Hard Search Spaces. NeurIPS (2021)
Karel Chvalovský, Jan Jakubuv, Miroslav Olsák, Josef Urban
Learning Theorem Proving Components. TABLEAUX (2021)
Jaroslav Macke, Jirí Sedlár, Miroslav Olsák, Josef Urban, Josef Sivic
Learning to solve geometric construction problems from images. CoRR (2021)
Libor Barto, Michael Kompatscher, Miroslav Olsák, Trung Van Pham, Michael Pinsker
Erratum: Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures. J. Math. Log. 21 (2) (2021)
Zsolt Zombori, Josef Urban, Miroslav Olsák
The Role of Entropy in Guiding a Connection Prover. TABLEAUX (2021)
Jaroslav Macke, Jirí Sedlár, Miroslav Olsák, Josef Urban, Josef Sivic
Learning to Solve Geometric Construction Problems from Images. CICM (2021)
Zarathustra Amadeus Goertzel, Karel Chvalovský, Jan Jakubuv, Miroslav Olsák, Josef Urban
Fast and Slow Enigmas and Parental Guidance. CoRR (2021)
Zarathustra Amadeus Goertzel, Karel Chvalovský, Jan Jakubuv, Miroslav Olsák, Josef Urban
Fast and Slow Enigmas and Parental Guidance. FroCoS (2021)
Miroslav Olsák
Maltsev conditions for General Congruence Meet-semidistributive Algebras. J. Symb. Log. 86 (4) (2021)
Karel Chvalovský, Jan Jakubuv, Miroslav Olsák, Josef Urban
Learning Theorem Proving Components. CoRR (2021)
Jan Jakubuv, Karel Chvalovský, Miroslav Olsák, Bartosz Piotrowski, Martin Suda, Josef Urban
ENIGMA Anonymous: Symbol-Independent Inference Guiding Machine (system description). CoRR (2020)
Jan Jakubuv, Karel Chvalovský, Miroslav Olsák, Bartosz Piotrowski, Martin Suda, Josef Urban
ENIGMA Anonymous: Symbol-Independent Inference Guiding Machine (System Description). IJCAR (2) (2020)
Miroslav Olsák
GeoLogic - Graphical interactive theorem prover for Euclidean geometry. CoRR (2020)
Miroslav Olsák
Loop conditions for strongly connected digraphs. Int. J. Algebra Comput. 30 (03) (2020)
Miroslav Olsák
GeoLogic - Graphical Interactive Theorem Prover for Euclidean Geometry. ICMS (2020)
Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard
ω-categorical structures avoiding height 1 identities. CoRR (2020)
Miroslav Olsák, Cezary Kaliszyk, Josef Urban
Property Invariant Embedding for Automated Reasoning. ECAI (2020)
Miron Ficak, Marcin Kozik, Miroslav Olsák, Szymon Stankiewicz
Dichotomy for Symmetric Boolean PCSPs. ICALP (2019)
Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard
Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems). LICS (2019)
Miron Ficak, Marcin Kozik, Miroslav Olsák, Szymon Stankiewicz
Dichotomy for symmetric Boolean PCSPs. CoRR (2019)
Miroslav Olsák, Cezary Kaliszyk, Josef Urban
Property Invariant Embedding for Automated Reasoning. CoRR (2019)
Libor Barto, Michael Kompatscher, Miroslav Olsák, Van Trung Pham, Michael Pinsker
Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures. J. Math. Log. 19 (2) (2019)
Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard
Topology is relevant (in the infinite-domain dichotomy conjecture for constraint satisfaction problems). CoRR (2019)
Cezary Kaliszyk, Josef Urban, Henryk Michalewski, Miroslav Olsák
Reinforcement Learning of Theorem Proving. NeurIPS (2018)
Libor Barto, Michael Kompatscher, Miroslav Olsák, Trung Van Pham, Michael Pinsker
The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems. LICS (2017)
Libor Barto, Michael Kompatscher, Miroslav Olsák, Michael Pinsker, Van Trung Pham
Equations in oligomorphic clones and the Constraint Satisfaction Problem for $ω$-categorical structures. CoRR (2016)