Get started
Author

Tomáš Balyo

Observed names: Balyo, T., Balyo, Tomas, Balyo, Tomáš, T. Balyo, Toma Balyo, Tomas Balyo, Toma´s Balyoˇ, Tomás Balyo
OpenAlex ID: A5021197854
SAT Competition 2016: Recent Developments
2017 · Tomas Balyo, Marijn Heule, et al. · Proceedings of the AAAI Conference on Artificial Intelligence · 78
HordeSat: A Massively Parallel Portfolio SAT Solver
2015 · Tomáš Balyo, Peter Sanders, et al. · Lecture notes in computer science · 70
SAT Race 2015
2016 · Tomáš Balyo, Armin Biere, et al. · Artificial Intelligence · 45
Proceedings of SAT Competition 2016: Solver and Benchmark Descriptions
2016 · Tomáš Balyo, Nils Froleyks, et al. · Työväentutkimus Vuosikirja · 33
Tree-REX: SAT-Based Tree Exploration for Efficient and High-Quality HTN Planning
2019 · Dominik Schreiber, Damien Pellier, et al. · Proceedings of the International Conference on Automated Planning and Scheduling · 24
PDF
Parallel Satisfiability
2018 · Tomáš Balyo, Carsten Sinz · Springer eBooks · 19
Relaxing the Relaxed Exist-Step Parallel Planning Semantics
2013 · Toma Balyo · IEEE International Conference on Tools with Artificial Intelligence (ICTAI) · 16
Accelerating SAT Based Planning with Incremental SAT Solving
2017 · Stephan Gocht, Tomáš Balyo · Proceedings of the International Conference on Automated Planning and Scheduling · 15
PDF
Everything You Always Wanted to Know about Blocked Sets (But Were Afraid to Ask)
2014 · Tomáš Balyo, Andreas Fröhlich, et al. · Lecture notes in computer science · 15
Complexity issues related to propagation completeness
2013 · Martin Babka, Tomáš Balyo, et al. · Artificial Intelligence · 14
Using Algorithm Configuration Tools to Generate Hard SAT Benchmarks
2021 · Tomáš Balyo, Lukáš Chrpa · Proceedings of the International Symposium on Combinatorial Search · 10
PDF
On hierarchies over the SLUR class.
2012 · Václav Vlček, Tomáš Balyo, et al. · ISAIM · 9
HordeQBF: A Modular and Massively Parallel QBF Solver
2016 · Tomáš Balyo, Florian Lonsing · Lecture notes in computer science · 8
PDF
HordeSat: A Massively Parallel Portfolio SAT Solver
2015 · Balyo, Tomas, Sanders, Peter, et al. · arXiv (Cornell University) · 7
PDF
On Different Strategies for Eliminating Redundant Actions from Plans
2021 · Tomáš Balyo, Lukáš Chrpa, et al. · Proceedings of the International Symposium on Combinatorial Search · 6
PDF
Finding Optimal Longest Paths by Dynamic Programming in Parallel
2021 · Kai Fieger, Tomas Balyo, et al. · Proceedings of the International Symposium on Combinatorial Search · 6
PDF
On Improving Plan Quality via Local Enhancements
2021 · Tomas Balyo, Roman Bartak, et al. · Proceedings of the International Symposium on Combinatorial Search · 5
PDF
Using DimSpec for Bounded and Unbounded Software Model Checking
2019 · Marko Kleine Büning, Tomáš Balyo, et al. · Lecture notes in computer science · 5
Shortening Plans by Local Re-planning
2012 · T. Balyo, R. Bartak, et al. · IEEE International Conference on Tools with Artificial Intelligence (ICTAI) · 5
Memory Efficient Parallel SAT Solving with Inprocessing
2019 · Ashlin Iser, Tomás Balyo, et al. · IEEE International Conference on Tools with Artificial Intelligence (ICTAI) · 4
Efficient SAT Encodings for Hierarchical Planning
2019 · Dominik Schreiber, Damien Pellier, et al. · International Conference on Agents and Artificial Intelligence (ICAART) · 4
Reinforced Encoding for Planning as Sat
2015 · Tomáš Balyo, Roman Barták, et al. · Acta Polytechnica CTU Proceedings · 3
PDF
Eliminating All Redundant Actions from Plans Using SAT and MaxSAT
2014 · Tomáš Balyo, Lukáš Chrpa · University of Huddersfield Repository (University of Huddersfield) · 2
PDF
Planning Domain Model Acquisition from State Traces without Action Parameters
2024 · Tomáš Balyo, Martin Suda, et al. · Principles of Knowledge Representation and Reasoning · 1
PDF
Cloud Kitchen: Using Planning-based Composite AI to Optimize Food Delivery Processes
2024 · Švancár, Slavomír, Chrpa, Lukáš, et al. · arXiv (Cornell University) · 1
PDF
Works count: 53
Citation count: 414
H-index: 10
I10-index: 11
Year
Topic
Type