Shortening Plans by Local Re-planning. - Tomás Balyo; Roman Barták; Pavel Surynek (ICTAI, 2012)

On hierarchies over the SLUR class. - Václav Vlcek; Tomás Balyo; Stefan Gurský; Petr Kucera (ISAIM, 2012)

On Improving Plan Quality via Local Enhancements. - Tomás Balyo; Roman Barták; Pavel Surynek (SOCS, 2012)

Relaxing the Relaxed Exist-Step Parallel Planning Semantics. - Tomás Balyo (ICTAI, 2013)

Solving SMT Problems with a Costly Decision Procedure by Finding Minimum Satisfying Assignments of Boolean Formulas. - Martin Babka; Tomás Balyo; Jaroslav Keznikl (SERA (selected papers), 2013)

Complexity issues related to propagation completeness. - Martin Babka; Tomás Balyo; Ondrej Cepek; Stefan Gurský; Petr Kucera; Václav Vlcek (Artif. Intell., 2013)

Everything You Always Wanted to Know about Blocked Sets (But Were Afraid to Ask). - Tomás Balyo; Andreas Fröhlich; Marijn Heule; Armin Biere (SAT, 2014)

On Different Strategies for Eliminating Redundant Actions from Plans. - Tomás Balyo; Lukás Chrpa; Asma Kilani (SOCS, 2014)

HordeSat: A Massively Parallel Portfolio SAT Solver. - Tomás Balyo; Peter Sanders 001; Carsten Sinz (SAT, 2015)

No One SATPlan Encoding To Rule Them All. - Tomás Balyo; Roman Barták (SOCS, 2015)

HordeQBF: A Modular and Massively Parallel QBF Solver. - Tomás Balyo; Florian Lonsing (SAT, 2016)

SAT Race 2015. - Tomás Balyo; Armin Biere; Markus Iser; Carsten Sinz (Artif. Intell., 2016)

SAT Competition 2016: Recent Developments. - Tomás Balyo; Marijn J. H. Heule; Matti Järvisalo (AAAI, 2017)

Accelerating SAT Based Planning with Incremental SAT Solving. - Stephan Gocht; Tomás Balyo (ICAPS, 2017)

Using an Algorithm Portfolio to Solve Sokoban. - Nils Christian Froleyks; Tomás Balyo (SOCS, 2017)

Optimal Longest Paths by Dynamic Programming. - Tomás Balyo; Kai Fieger; Christian Schulz 003 (CoRR, 2017)

Parallel Satisfiability. - Tomás Balyo; Carsten Sinz (Handbook of Parallel Constraint Reasoning, 2018)

Using Algorithm Configuration Tools to Generate Hard SAT Benchmarks. - Tomás Balyo; Lukás Chrpa (SOCS, 2018)

Unbounded Software Model Checking with Incremental SAT-Solving. - Marko Kleine Büning; Tomás Balyo; Carsten Sinz (CoRR, 2018)

Tree-REX: SAT-Based Tree Exploration for Efficient and High-Quality HTN Planning. - Dominik Schreiber 001; Damien Pellier; Humbert Fiorino; Tomás Balyo (ICAPS, 2019)

Efficient SAT Encodings for Hierarchical Planning. - Dominik Schreiber 001; Damien Pellier; Humbert Fiorino; Tomás Balyo (ICAART (2), 2019)

Using DimSpec for Bounded and Unbounded Software Model Checking. - Marko Kleine Büning; Tomás Balyo; Carsten Sinz (ICFEM, 2019)

Memory Efficient Parallel SAT Solving with Inprocessing. - Markus Iser; Tomás Balyo; Carsten Sinz (ICTAI, 2019)

Finding Optimal Longest Paths by Dynamic Programming in Parallel. - Kai Fieger; Tomás Balyo; Christian Schulz 003; Dominik Schreiber 001 (SOCS, 2019)

PASAR - Planning as Satisfiability with Abstraction Refinement. - Nils Christian Froleyks; Tomás Balyo; Dominik Schreiber 001 (SOCS, 2019)

AI Assisted Design of Sokoban Puzzles Using Automated Planning. - Tomás Balyo; Nils Froleyks (ArtsIT, 2021)

Fast Approximate Calculation of Valid Domains in a Satisfiability-based Product Configurator. - Johannes Werner; Tomás Balyo; Markus Iser; Michael Klein (ConfWS, 2021)

Unit Propagation with Stable Watches (Short Paper). - Markus Iser; Tomás Balyo (CP, 2021)

Parallelizing a SAT-Based Product Configurator. - Nils Merlin Ullmann; Tomás Balyo; Michael Klein (CP, 2021)

Black-box optimization in a configuration system. - Maximilian Kucher; Tomás Balyo; Noemi Christensen (SPLC (B), 2022)

Explainable AI for Constraint-Based Expert Systems. - Jan Bode; Max Schemmer; Tomás Balyo (Wirtschaftsinformatik, 2022)

Decision Heuristics in a Constraint-based Product Configurator. - Matthias Gorenflo; Tomás Balyo; Markus Iser; Tobias Ostertag (ConfWS, 2023)

Construction of Decision Diagrams for Product Configuration. - Maxim Popov; Tomás Balyo; Markus Iser; Tobias Ostertag (ConfWS, 2023)

Planning Domain Model Acquisition from State Traces without Action Parameters. - Tomás Balyo; Martin Suda 001; Lukás Chrpa; Dominik Safránek; Stephan Gocht; Filip Dvorák; Roman Barták; G. Michael Youngblood (KR, 2024)

Cloud Kitchen: Using Planning-based Composite AI to Optimize Food Delivery Process. - Slavomír Svancár; Lukás Chrpa; Filip Dvorák; Tomás Balyo (CoRR, 2024)

Learning Planning Action Models from State Traces. - Tomás Balyo; Martin Suda 001; Lukás Chrpa; Dominik Safránek; Filip Dvorák; Roman Barták; G. Michael Youngblood (CoRR, 2024)

On Automating Video Game Testing by Planning and Learning. - Tomás Balyo; G. Michael Youngblood; Filip Dvorák; Roman Barták (CoRR, 2024)