Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomás Balyo
Person information
- unicode name: Tomáš Balyo
- affiliation: Karlsruhe Institute of Technology, Institute of Theoretical Informatics, Germany
- affiliation: Charles University in Prague, Department of Theoretical Computer Science and Mathematical Logic, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i8]Slavomír Svancár, Lukás Chrpa, Filip Dvorák, Tomás Balyo:
Cloud Kitchen: Using Planning-based Composite AI to Optimize Food Delivery Process. CoRR abs/2402.10725 (2024)- [i7]Tomás Balyo, Martin Suda, Lukás Chrpa, Dominik Safránek, Filip Dvorák, Roman Barták, G. Michael Youngblood:
Learning Planning Action Models from State Traces. CoRR abs/2402.10726 (2024) - [i6]Tomás Balyo, G. Michael Youngblood, Filip Dvorák, Roman Barták:
On Automating Video Game Testing by Planning and Learning. CoRR abs/2402.12393 (2024) - 2023
- [c28]Matthias Gorenflo, Tomás Balyo, Markus Iser, Tobias Ostertag:
Decision Heuristics in a Constraint-based Product Configurator. ConfWS 2023: 51-59 - [c27]Maxim Popov, Tomás Balyo, Markus Iser, Tobias Ostertag:
Construction of Decision Diagrams for Product Configuration. ConfWS 2023: 108-117 - 2022
- [c26]Maximilian Kucher, Tomás Balyo, Noemi Christensen:
Black-box optimization in a configuration system. SPLC (B) 2022: 229-236 - [c25]Jan Bode, Max Schemmer, Tomás Balyo:
Explainable AI for Constraint-Based Expert Systems. Wirtschaftsinformatik 2022 - 2021
- [c24]Tomás Balyo, Nils Froleyks:
AI Assisted Design of Sokoban Puzzles Using Automated Planning. ArtsIT 2021: 424-441 - [c23]Johannes Werner, Tomás Balyo, Markus Iser, Michael Klein:
Fast Approximate Calculation of Valid Domains in a Satisfiability-based Product Configurator. ConfWS 2021: 24-32 - [c22]Markus Iser
, Tomás Balyo:
Unit Propagation with Stable Watches (Short Paper). CP 2021: 6:1-6:8 - [c21]Nils Merlin Ullmann, Tomás Balyo, Michael Klein:
Parallelizing a SAT-Based Product Configurator. CP 2021: 55:1-55:18
2010 – 2019
- 2019
- [c20]Dominik Schreiber, Damien Pellier, Humbert Fiorino, Tomás Balyo:
Tree-REX: SAT-Based Tree Exploration for Efficient and High-Quality HTN Planning. ICAPS 2019: 382-390 - [c19]Dominik Schreiber, Damien Pellier, Humbert Fiorino, Tomás Balyo:
Efficient SAT Encodings for Hierarchical Planning. ICAART (2) 2019: 531-538 - [c18]Marko Kleine Büning, Tomás Balyo, Carsten Sinz:
Using DimSpec for Bounded and Unbounded Software Model Checking. ICFEM 2019: 19-35 - [c17]Markus Iser, Tomás Balyo, Carsten Sinz:
Memory Efficient Parallel SAT Solving with Inprocessing. ICTAI 2019: 64-70 - [c16]Kai Fieger, Tomás Balyo, Christian Schulz, Dominik Schreiber:
Finding Optimal Longest Paths by Dynamic Programming in Parallel. SOCS 2019: 61-69 - [c15]Nils Christian Froleyks, Tomás Balyo, Dominik Schreiber:
PASAR - Planning as Satisfiability with Abstraction Refinement. SOCS 2019: 70-78 - [i5]Kai Fieger, Tomás Balyo, Christian Schulz, Dominik Schreiber:
Finding Optimal Longest Paths by Dynamic Programming in Parallel. CoRR abs/1905.03645 (2019) - 2018
- [c14]Tomás Balyo, Lukás Chrpa:
Using Algorithm Configuration Tools to Generate Hard SAT Benchmarks. SOCS 2018: 133-137 - [p1]Tomás Balyo, Carsten Sinz:
Parallel Satisfiability. Handbook of Parallel Constraint Reasoning 2018: 3-29 - [i4]Marko Kleine Büning, Tomás Balyo, Carsten Sinz:
Unbounded Software Model Checking with Incremental SAT-Solving. CoRR abs/1802.04174 (2018) - 2017
- [c13]Tomás Balyo, Marijn J. H. Heule, Matti Järvisalo:
SAT Competition 2016: Recent Developments. AAAI 2017: 5061-5063 - [c12]Stephan Gocht, Tomás Balyo:
Accelerating SAT Based Planning with Incremental SAT Solving. ICAPS 2017: 135-139 - [c11]Nils Christian Froleyks, Tomás Balyo:
Using an Algorithm Portfolio to Solve Sokoban. SOCS 2017: 165-166 - [i3]Tomás Balyo, Kai Fieger, Christian Schulz:
Optimal Longest Paths by Dynamic Programming. CoRR abs/1702.04170 (2017) - 2016
- [j2]Tomás Balyo, Armin Biere, Markus Iser, Carsten Sinz:
SAT Race 2015. Artif. Intell. 241: 45-65 (2016) - [c10]Tomás Balyo, Florian Lonsing:
HordeQBF: A Modular and Massively Parallel QBF Solver. SAT 2016: 531-538 - [i2]Tomás Balyo, Florian Lonsing:
HordeQBF: A Modular and Massively Parallel QBF Solver. CoRR abs/1604.03793 (2016) - 2015
- [c9]Tomás Balyo, Peter Sanders, Carsten Sinz:
HordeSat: A Massively Parallel Portfolio SAT Solver. SAT 2015: 156-172 - [c8]Tomás Balyo, Roman Barták:
No One SATPlan Encoding To Rule Them All. SOCS 2015: 146-150 - [i1]Tomás Balyo, Peter Sanders, Carsten Sinz:
HordeSat: A Massively Parallel Portfolio SAT Solver. CoRR abs/1505.03340 (2015) - 2014
- [c7]Tomás Balyo, Andreas Fröhlich, Marijn Heule, Armin Biere:
Everything You Always Wanted to Know about Blocked Sets (But Were Afraid to Ask). SAT 2014: 317-332 - [c6]Tomás Balyo, Lukás Chrpa, Asma Kilani:
On Different Strategies for Eliminating Redundant Actions from Plans. SOCS 2014: 10-18 - 2013
- [j1]Martin Babka, Tomás Balyo, Ondrej Cepek, Stefan Gurský, Petr Kucera, Václav Vlcek:
Complexity issues related to propagation completeness. Artif. Intell. 203: 19-34 (2013) - [c5]Tomás Balyo:
Relaxing the Relaxed Exist-Step Parallel Planning Semantics. ICTAI 2013: 865-871 - [c4]Martin Babka, Tomás Balyo, Jaroslav Keznikl:
Solving SMT Problems with a Costly Decision Procedure by Finding Minimum Satisfying Assignments of Boolean Formulas. SERA (selected papers) 2013: 231-246 - 2012
- [c3]Tomás Balyo, Roman Barták, Pavel Surynek:
Shortening Plans by Local Re-planning. ICTAI 2012: 1022-1028 - [c2]Václav Vlcek, Tomás Balyo, Stefan Gurský, Petr Kucera:
On hierarchies over the SLUR class. ISAIM 2012 - [c1]Tomás Balyo, Roman Barták, Pavel Surynek:
On Improving Plan Quality via Local Enhancements. SOCS 2012: 154-156
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-04-25 05:51 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:
