default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMiroslav Olsák
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Lasse Blaauwbroek
, Miroslav Olsák, Herman Geuvers:
Hashing Modulo Context-Sensitive 𝛼-Equivalence. Proc. ACM Program. Lang. 8(PLDI): 2027-2050 (2024)- [c17]Simon Frieder, Mirek Olsák, Julius Berner, Thomas Lukasiewicz:
The IMO Small Challenge: Not-Too-Hard Olympiad Math Datasets for LLMs. Tiny Papers @ ICLR 2024 - [c16]Lasse Blaauwbroek, Mirek Olsák, Jason Rute, Fidel Ivan Schaposnik Massolo, Jelle Piepenbrock, Vasily Pestun:
Graph2Tac: Online Representation Learning of Formal Math Concepts. ICML 2024 - [c15]Chad E. Brown, Mikolas Janota, Mirek Olsák:
Symbolic Computation for All the Fun. PAAR+SC²@IJCAR 2024: 111-121 - [i20]Lasse Blaauwbroek, Miroslav Olsák, Herman Geuvers:
Hashing Modulo Context-Sensitive α-Equivalence. CoRR abs/2401.02948 (2024) - [i19]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 abs/2401.02949 (2024) - [i18]Chad E. Brown, Mikolás Janota, Mirek Olsák:
Symbolic Computation for All the Fun. CoRR abs/2404.12048 (2024) - 2023
- [j5]Thibault Gauthier, Miroslav Olsák, Josef Urban:
Alien coding. Int. J. Approx. Reason. 162: 109009 (2023) - [c14]Jan Jakubuv, Karel Chvalovský, Zarathustra Amadeus Goertzel, Cezary Kaliszyk, Mirek Olsák, Bartosz Piotrowski, Stephan Schulz, Martin Suda, Josef Urban:
MizAR 60 for Mizar 50. ITP 2023: 19:1-19:22 - [i17]Thibault Gauthier, Miroslav Olsák, Josef Urban:
Alien Coding. CoRR abs/2301.11479 (2023) - [i16]Jan Jakubuv, Karel Chvalovský, Zarathustra Amadeus Goertzel, Cezary Kaliszyk, Mirek Olsák, Bartosz Piotrowski, Stephan Schulz, Martin Suda, Josef Urban:
MizAR 60 for Mizar 50. CoRR abs/2303.06686 (2023) - 2022
- [c13]Zarathustra Amadeus Goertzel, Jan Jakubuv, Cezary Kaliszyk, Miroslav Olsák, Jelle Piepenbrock, Josef Urban:
The Isabelle ENIGMA. ITP 2022: 16:1-16:21 - [i15]Zarathustra Amadeus Goertzel, Jan Jakubuv, Cezary Kaliszyk, Miroslav Olsák, Jelle Piepenbrock, Josef Urban:
The Isabelle ENIGMA. CoRR abs/2205.01981 (2022) - [i14]Jelle Piepenbrock, Josef Urban, Konstantin Korovin, Miroslav Olsák, Tom Heskes, Mikolas Janota:
Machine Learning Meets The Herbrand Universe. CoRR abs/2210.03590 (2022) - 2021
- [j4]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): 2192001:1 (2021) - [j3]Miroslav Olsák:
Maltsev conditions for General Congruence Meet-semidistributive Algebras. J. Symb. Log. 86(4): 1432-1451 (2021) - [c12]Zarathustra Amadeus Goertzel, Karel Chvalovský, Jan Jakubuv, Miroslav Olsák, Josef Urban:
Fast and Slow Enigmas and Parental Guidance. FroCoS 2021: 173-191 - [c11]Jaroslav Macke, Jirí Sedlár, Miroslav Olsák, Josef Urban, Josef Sivic:
Learning to Solve Geometric Construction Problems from Images. CICM 2021: 167-184 - [c10]Marco Bagatella, Miroslav Olsák, Michal Rolínek, Georg Martius:
Planning from Pixels in Environments with Combinatorially Hard Search Spaces. NeurIPS 2021: 24707-24718 - [c9]Zsolt Zombori, Josef Urban, Miroslav Olsák:
The Role of Entropy in Guiding a Connection Prover. TABLEAUX 2021: 218-235 - [c8]Karel Chvalovský, Jan Jakubuv, Miroslav Olsák, Josef Urban:
Learning Theorem Proving Components. TABLEAUX 2021: 266-278 - [i13]Zsolt Zombori, Josef Urban, Miroslav Olsák:
The Role of Entropy in Guiding a Connection Prover. CoRR abs/2105.14706 (2021) - [i12]Jaroslav Macke, Jirí Sedlár, Miroslav Olsák, Josef Urban, Josef Sivic:
Learning to solve geometric construction problems from images. CoRR abs/2106.14195 (2021) - [i11]Zarathustra Amadeus Goertzel, Karel Chvalovský, Jan Jakubuv, Miroslav Olsák, Josef Urban:
Fast and Slow Enigmas and Parental Guidance. CoRR abs/2107.06750 (2021) - [i10]Karel Chvalovský, Jan Jakubuv, Miroslav Olsák, Josef Urban:
Learning Theorem Proving Components. CoRR abs/2107.10034 (2021) - [i9]Marco Bagatella, Mirek Olsák, Michal Rolínek, Georg Martius:
Planning from Pixels in Environments with Combinatorially Hard Search Spaces. CoRR abs/2110.06149 (2021) - 2020
- [j2]Miroslav Olsák:
Loop conditions for strongly connected digraphs. Int. J. Algebra Comput. 30(03): 467-499 (2020) - [c7]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: 448-463 - [c6]Miroslav Olsák, Cezary Kaliszyk, Josef Urban:
Property Invariant Embedding for Automated Reasoning. ECAI 2020: 1395-1402 - [c5]Miroslav Olsák:
GeoLogic - Graphical Interactive Theorem Prover for Euclidean Geometry. ICMS 2020: 263-271 - [i8]Jan Jakubuv, Karel Chvalovský, Miroslav Olsák, Bartosz Piotrowski, Martin Suda, Josef Urban:
ENIGMA Anonymous: Symbol-Independent Inference Guiding Machine (system description). CoRR abs/2002.05406 (2020) - [i7]Miroslav Olsák:
GeoLogic - Graphical interactive theorem prover for Euclidean geometry. CoRR abs/2005.03586 (2020) - [i6]Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard:
ω-categorical structures avoiding height 1 identities. CoRR abs/2006.12254 (2020)
2010 – 2019
- 2019
- [j1]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): 1950010:1-1950010:31 (2019) - [c4]Miron Ficak, Marcin Kozik, Miroslav Olsák, Szymon Stankiewicz:
Dichotomy for Symmetric Boolean PCSPs. ICALP 2019: 57:1-57:12 - [c3]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: 1-12 - [i5]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 abs/1901.04237 (2019) - [i4]Miron Ficak, Marcin Kozik, Miroslav Olsák, Szymon Stankiewicz:
Dichotomy for symmetric Boolean PCSPs. CoRR abs/1904.12424 (2019) - [i3]Miroslav Olsák, Cezary Kaliszyk, Josef Urban:
Property Invariant Embedding for Automated Reasoning. CoRR abs/1911.12073 (2019) - 2018
- [c2]Cezary Kaliszyk, Josef Urban, Henryk Michalewski, Miroslav Olsák:
Reinforcement Learning of Theorem Proving. NeurIPS 2018: 8836-8847 - [i2]Cezary Kaliszyk, Josef Urban, Henryk Michalewski, Mirek Olsák:
Reinforcement Learning of Theorem Proving. CoRR abs/1805.07563 (2018) - 2017
- [c1]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: 1-12 - 2016
- [i1]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 abs/1612.07551 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-04 01:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
