Tomás Balyo

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 27

Top Topics

Boolean Satisfiability

Automated Planning

Top Venues

Publications

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 (2024)
Tomás Balyo, G. Michael Youngblood, Filip Dvorák, Roman Barták
On Automating Video Game Testing by Planning and Learning. CoRR (2024)
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 (2024)
Matthias Gorenflo, Tomás Balyo, Markus Iser, Tobias Ostertag
Decision Heuristics in a Constraint-based Product Configurator. ConfWS (2023)
Maxim Popov, Tomás Balyo, Markus Iser, Tobias Ostertag
Construction of Decision Diagrams for Product Configuration. ConfWS (2023)
Maximilian Kucher, Tomás Balyo, Noemi Christensen
Black-box optimization in a configuration system. SPLC (B) (2022)
Jan Bode, Max Schemmer, Tomás Balyo
Explainable AI for Constraint-Based Expert Systems. Wirtschaftsinformatik (2022)
Markus Iser, Tomás Balyo
Unit Propagation with Stable Watches (Short Paper). CP (2021)
Nils Merlin Ullmann, Tomás Balyo, Michael Klein
Parallelizing a SAT-Based Product Configurator. CP (2021)
Tomás Balyo, Nils Froleyks
AI Assisted Design of Sokoban Puzzles Using Automated Planning. ArtsIT (2021)
Johannes Werner, Tomás Balyo, Markus Iser, Michael Klein
Fast Approximate Calculation of Valid Domains in a Satisfiability-based Product Configurator. ConfWS (2021)
Marko Kleine Büning, Tomás Balyo, Carsten Sinz
Using DimSpec for Bounded and Unbounded Software Model Checking. ICFEM (2019)
Markus Iser, Tomás Balyo, Carsten Sinz
Memory Efficient Parallel SAT Solving with Inprocessing. ICTAI (2019)
Kai Fieger, Tomás Balyo, Christian Schulz, Dominik Schreiber
Finding Optimal Longest Paths by Dynamic Programming in Parallel. CoRR (2019)
Kai Fieger, Tomás Balyo, Christian Schulz, Dominik Schreiber
Finding Optimal Longest Paths by Dynamic Programming in Parallel. SOCS (2019)
Nils Christian Froleyks, Tomás Balyo, Dominik Schreiber
PASAR - Planning as Satisfiability with Abstraction Refinement. SOCS (2019)
Dominik Schreiber, Damien Pellier, Humbert Fiorino, Tomás Balyo
Tree-REX: SAT-Based Tree Exploration for Efficient and High-Quality HTN Planning. ICAPS (2019)
Dominik Schreiber, Damien Pellier, Humbert Fiorino, Tomás Balyo
Efficient SAT Encodings for Hierarchical Planning. ICAART (2) (2019)
Marko Kleine Büning, Tomás Balyo, Carsten Sinz
Unbounded Software Model Checking with Incremental SAT-Solving. CoRR (2018)
Tomás Balyo, Lukás Chrpa
Using Algorithm Configuration Tools to Generate Hard SAT Benchmarks. SOCS (2018)
Nils Christian Froleyks, Tomás Balyo
Using an Algorithm Portfolio to Solve Sokoban. SOCS (2017)
Stephan Gocht, Tomás Balyo
Accelerating SAT Based Planning with Incremental SAT Solving. ICAPS (2017)
Tomás Balyo, Kai Fieger, Christian Schulz
Optimal Longest Paths by Dynamic Programming. CoRR (2017)
Tomás Balyo, Marijn J. H. Heule, Matti Järvisalo
SAT Competition 2016: Recent Developments. AAAI (2017)
Tomás Balyo, Florian Lonsing
HordeQBF: A Modular and Massively Parallel QBF Solver. CoRR (2016)
Tomás Balyo, Florian Lonsing
HordeQBF: A Modular and Massively Parallel QBF Solver. SAT (2016)
Tomás Balyo, Armin Biere, Markus Iser, Carsten Sinz
SAT Race 2015. Artif. Intell. 241 (2016)
Tomás Balyo, Peter Sanders, Carsten Sinz
HordeSat: A Massively Parallel Portfolio SAT Solver. SAT (2015)
Tomás Balyo, Peter Sanders, Carsten Sinz
HordeSat: A Massively Parallel Portfolio SAT Solver. CoRR (2015)
Tomás Balyo, Roman Barták
No One SATPlan Encoding To Rule Them All. SOCS (2015)
Tomás Balyo, Lukás Chrpa, Asma Kilani
On Different Strategies for Eliminating Redundant Actions from Plans. SOCS (2014)
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)
Martin Babka, Tomás Balyo, Ondrej Cepek, Stefan Gurský, Petr Kucera, Václav Vlcek
Complexity issues related to propagation completeness. Artif. Intell. 203 (2013)
Tomás Balyo
Relaxing the Relaxed Exist-Step Parallel Planning Semantics. ICTAI (2013)
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)
Tomás Balyo, Roman Barták, Pavel Surynek
On Improving Plan Quality via Local Enhancements. SOCS (2012)
Tomás Balyo, Roman Barták, Pavel Surynek
Shortening Plans by Local Re-planning. ICTAI (2012)
Václav Vlcek, Tomás Balyo, Stefan Gurský, Petr Kucera
On hierarchies over the SLUR class. ISAIM (2012)