default search action
Karel Chvalovský
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c11]Filip Bártek, Karel Chvalovský, Martin Suda:
Regularization in Spider-Style Strategy Discovery and Schedule Construction. IJCAR (1) 2024: 194-213 - [c10]Filip Bártek, Karel Chvalovský, Martin Suda:
Cautious Specialization of Strategy Schedules (Extended Abstract). PAAR+SC²@IJCAR 2024: 28-36 - [i6]Filip Bártek, Karel Chvalovský, Martin Suda:
Regularization in Spider-Style Strategy Discovery and Schedule Construction. CoRR abs/2403.12869 (2024) - 2023
- [c9]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 - [c8]Karel Chvalovský, Konstantin Korovin, Jelle Piepenbrock, Josef Urban:
Guiding an Instantiation Prover with Graph Neural Networks. LPAR 2023: 112-123 - [c7]Mikolás Janota, Bartosz Piotrowski, Karel Chvalovský:
Towards Learning Infinite SMT Models (Work in Progress). SYNASC 2023: 82-85 - [i5]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) - 2021
- [c6]Zarathustra Amadeus Goertzel, Karel Chvalovský, Jan Jakubuv, Miroslav Olsák, Josef Urban:
Fast and Slow Enigmas and Parental Guidance. FroCoS 2021: 173-191 - [c5]Karel Chvalovský, Jan Jakubuv, Miroslav Olsák, Josef Urban:
Learning Theorem Proving Components. TABLEAUX 2021: 266-278 - [i4]Zarathustra Amadeus Goertzel, Karel Chvalovský, Jan Jakubuv, Miroslav Olsák, Josef Urban:
Fast and Slow Enigmas and Parental Guidance. CoRR abs/2107.06750 (2021) - [i3]Karel Chvalovský, Jan Jakubuv, Miroslav Olsák, Josef Urban:
Learning Theorem Proving Components. CoRR abs/2107.10034 (2021) - 2020
- [c4]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 - [i2]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)
2010 – 2019
- 2019
- [c3]Karel Chvalovský, Jan Jakubuv, Martin Suda, Josef Urban:
ENIGMA-NG: Efficient Neural and Gradient-Boosted Inference Guidance for E. CADE 2019: 197-215 - [c2]Karel Chvalovský:
Top-Down Neural Model For Formulae. ICLR (Poster) 2019 - [i1]Karel Chvalovský, Jan Jakubuv, Martin Suda, Josef Urban:
ENIGMA-NG: Efficient Neural and Gradient-Boosted Inference Guidance for E. CoRR abs/1903.03182 (2019) - 2016
- [j4]Karel Chvalovský, Rostislav Horcík:
Full Lambek Calculus with Contraction is Undecidable. J. Symb. Log. 81(2): 524-540 (2016) - 2015
- [j3]Karel Chvalovský:
Undecidability of Consequence Relation in Full non-Associative Lambek Calculus. J. Symb. Log. 80(2): 567-586 (2015) - 2012
- [j2]Karel Chvalovský:
On the independence of axioms in BL and MTL. Fuzzy Sets Syst. 197: 123-129 (2012) - [j1]Karel Chvalovský, Petr Cintula:
Note on Deduction Theorems in contraction-free logics. Math. Log. Q. 58(3): 236-243 (2012) - 2010
- [c1]Karel Chvalovský, Petr Cintula:
Note on Deduction Theorems in Contraction-Free Logics. LPAR short papers(Yogyakarta) 2010: 26-29
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-08-05 21:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint