default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRostislav Horcík
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c20]Rostislav Horcík, Gustav Sír:
Expressiveness of Graph Neural Networks in Planning Domains. ICAPS 2024: 281-289- [i2]Dillon Z. Chen, Rostislav Horcík, Gustav Sír:
Deep Learning for Generalised Planning with Background Knowledge. CoRR abs/2410.07923 (2024) - 2023
- [c19]Rostislav Horcík
, Daniel Fiser:
Gaifman Graphs in Lifted Planning. ECAI 2023: 1052-1059 - 2022
- [c18]Lukás Chrpa, Pavel Rytír, Rostislav Horcík, Stefan Edelkamp:
Competing for Resources: Estimating Adversary Strategy for Effective Plan Generation. AAAI 2022: 9707-9715 - [c17]Rostislav Horcík, Daniel Fiser, Álvaro Torralba:
Homomorphisms of Lifted Planning Tasks: The Case for Delete-Free Relaxation Heuristics. AAAI 2022: 9767-9775 - [c16]Rostislav Horcík, Álvaro Torralba, Pavel Rytír, Lukás Chrpa, Stefan Edelkamp:
Optimal Mixed Strategies for Cost-Adversarial Planning Games. ICAPS 2022: 160-168 - [c15]Lukás Chrpa, Pavel Rytír, Andrii Nyporko, Rostislav Horcík, Stefan Edelkamp:
Effective Planning in Resource-Competition Problems by Task Decomposition. SOCS 2022: 47-55 - 2021
- [c14]Lukás Adam, Rostislav Horcík, Tomás Kasl, Tomás Kroupa:
Double Oracle Algorithm for Computing Equilibria in Continuous Games. AAAI 2021: 5070-5077 - [c13]Rostislav Horcík, Daniel Fiser:
Endomorphisms of Classical Planning Tasks. AAAI 2021: 11835-11843 - [c12]Rostislav Horcík, Daniel Fiser:
Endomorphisms of Lifted Planning Problems. ICAPS 2021: 174-183 - [c11]Lukás Chrpa, Pavel Rytír, Rostislav Horcík, Jan Cuhel, Anastasiia Livochka, Stefan Edelkamp:
Adversary Strategy Sampling for Effective Plan Generation. SOCS 2021: 164-166 - 2020
- [c10]Daniel Fiser, Rostislav Horcík, Antonín Komenda:
Strengthening Potential Heuristics with Mutexes and Disambiguations. ICAPS 2020: 124-133 - [c9]Lukás Chrpa, Pavel Rytír, Rostislav Horcík:
Planning Against Adversary in Zero-Sum Games: Heuristics for Selecting and Ordering Critical Actions. SOCS 2020: 20-28 - [i1]Lukás Adam, Rostislav Horcík, Tomás Kasl, Tomás Kroupa:
Double Oracle Algorithm for Computing Equilibria in Continuous Games. CoRR abs/2009.12185 (2020)
2010 – 2019
- 2017
- [c8]Rostislav Horcík, Tommaso Moraschini, Amanda Vidal:
An Algebraic Approach to Valued Constraint Satisfaction. CSL 2017: 42:1-42:20 - 2016
- [j18]Karel Chvalovský, Rostislav Horcík:
Full Lambek Calculus with Contraction is Undecidable. J. Symb. Log. 81(2): 524-540 (2016) - 2013
- [j17]Petr Cintula, Rostislav Horcík, Carles Noguera:
Nonassociative Substructural Logics and their semilinear Extensions: Axiomatization and Completeness Properties. Rev. Symb. Log. 6(3): 394-423 (2013) - [c7]Rostislav Horcík:
Residuated Lattices, Regular Languages, and Burnside Problem. TACL 2013: 6-7 - [c6]Nikolaos Galatos, Rostislav Horcík:
Cayley and Holland Theorems for Residuated Lattices. TACL 2013: 76-79 - 2012
- [j16]Rostislav Horcík:
Minimal Varieties of Representable Commutative Residuated Lattices. Stud Logica 100(6): 1063-1078 (2012) - [c5]Marta Bílková, Rostislav Horcík, Jirí Velebil:
Distributive Substructural Logics as Coalgebraic Logics over Posets. Advances in Modal Logic 2012: 119-142 - 2011
- [j15]Rostislav Horcík:
On the Structure of Finite Integral Commutative Residuated Chains. J. Log. Comput. 21(5): 717-728 (2011) - [j14]Rostislav Horcík, Kazushige Terui:
Disjunction property and complexity of substructural logics. Theor. Comput. Sci. 412(31): 3992-4006 (2011) - 2010
- [j13]Rostislav Horcík:
Solutions to Some Open Problems on Totally Ordered Monoids. J. Log. Comput. 20(4): 977-983 (2010)
2000 – 2009
- 2009
- [j12]Rostislav Horcík, Franco Montagna:
Archimedean classes in integral commutative residuated chains. Math. Log. Q. 55(3): 320-336 (2009) - 2008
- [j11]Rostislav Horcík:
Solution of a system of linear equations with fuzzy numbers. Fuzzy Sets Syst. 159(14): 1788-1810 (2008) - [p1]Rostislav Horcík:
How to Solve a System of Linear Equations with Fuzzy Numbers. Soft Computing for Hybrid Intelligent Systems 2008: 427-436 - 2007
- [j10]Petr Cintula, Petr Hájek, Rostislav Horcík:
Formal systems of fuzzy logic and their fragments. Ann. Pure Appl. Log. 150(1-3): 40-65 (2007) - [j9]Rostislav Horcík:
On the failure of standard completeness in PiMTL for infinite theories. Fuzzy Sets Syst. 158(6): 619-624 (2007) - [j8]Rostislav Horcík, Carles Noguera, Milan Petrík:
On n-contractive fuzzy logics. Math. Log. Q. 53(3): 268-288 (2007) - [j7]Rostislav Horcík:
Alternative Proof of Standard Completeness Theorem for MTL. Soft Comput. 11(2): 123-129 (2007) - [c4]Petr Cintula, Rostislav Horcík:
Fuzzy Class Theory: Some Advanced Topics. EUSFLAT Conf. (1) 2007: 137-143 - 2006
- [j6]Rostislav Horcík:
Decidability of Cancellative Extension of Monoidal T-norm Based Logic. Log. J. IGPL 14(6): 827-843 (2006) - [j5]Franco Montagna, Carles Noguera, Rostislav Horcík:
On Weakly Cancellative Fuzzy Logics. J. Log. Comput. 16(4): 423-450 (2006) - 2005
- [j4]Rostislav Horcík:
Standard completeness theorem for PiMTL. Arch. Math. Log. 44(4): 413-424 (2005) - [c3]Rostislav Horcík:
Stronger version of standard completeness theorem for MTL. EUSFLAT Conf. 2005: 878-883 - 2004
- [j3]Rostislav Horcík, Petr Cintula:
Product L ukasiewicz Logic. Arch. Math. Log. 43(4): 477-504 (2004) - [j2]Rostislav Horcík:
Residuated fuzzy logics with additional connectives and their validation sets. Fuzzy Sets Syst. 143(1): 75-87 (2004) - 2003
- [c2]Rostislav Horcík:
A note on the structure of PiMTL-chains and left-continuous cancellative T-norms. EUSFLAT Conf. 2003: 614-618 - [c1]Rostislav Horcík, Petr Cintula:
Extension of Lukasiewicz Logic by Product Connective. IFSA 2003: 180-188 - 2002
- [j1]Rostislav Horcík, Mirko Navara:
Validation sets in fuzzy logics. Kybernetika 38(3): 319-326 (2002)
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-11-19 21:43 CET 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:
