Tomás Balyo
19 publications
8 venues
H Index 8
Affiliation
Tom BalyoKarlsruhe Institute of Technology, Institute of Theoretical Informatics, Germany
Charles University in Prague, Department of Theoretical Computer Science and Mathematical Logic, Czech Republic
Links
| Name | Venue | Year | citations |
|---|---|---|---|
Using Planning for Automated Testing of Video Games.
|
IJCAI | 2025 | 0 |
| Planning Domain Model Acquisition from State Traces without Action Parameters.
|
KR | 2024 | 5 |
| Unit Propagation with Stable Watches (Short Paper).
|
CP | 2021 | 0 |
| Parallelizing a SAT-Based Product Configurator.
|
CP | 2021 | 1 |
| Tree-REX: SAT-Based Tree Exploration for Efficient and High-Quality HTN Planning.
|
ICAPS | 2019 | 36 |
| Finding Optimal Longest Paths by Dynamic Programming in Parallel.
|
SOCS | 2019 | 5 |
| PASAR - Planning as Satisfiability with Abstraction Refinement.
|
SOCS | 2019 | 0 |
| Using Algorithm Configuration Tools to Generate Hard SAT Benchmarks.
|
SOCS | 2018 | 0 |
| Accelerating SAT Based Planning with Incremental SAT Solving.
|
ICAPS | 2017 | 29 |
| SAT Competition 2016: Recent Developments.
|
AAAI | 2017 | 104 |
| Using an Algorithm Portfolio to Solve Sokoban.
|
SOCS | 2017 | 0 |
| HordeQBF: A Modular and Massively Parallel QBF Solver.
|
SAT | 2016 | 8 |
| SAT Race 2015.
|
Artificial Intelligence | 2016 | 65 |
| No One SATPlan Encoding To Rule Them All.
|
SOCS | 2015 | 0 |
| HordeSat: A Massively Parallel Portfolio SAT Solver.
|
SAT | 2015 | 82 |
| On Different Strategies for Eliminating Redundant Actions from Plans.
|
SOCS | 2014 | 14 |
| Everything You Always Wanted to Know about Blocked Sets (But Were Afraid to Ask).
|
SAT | 2014 | 18 |
| Complexity issues related to propagation completeness.
|
Artificial Intelligence | 2013 | 18 |
| On Improving Plan Quality via Local Enhancements.
|
SOCS | 2012 | 0 |