Tomás Balyo - RankMe

41 papers A* 5A 5B 10C 2Misc 1Journal 10Unranked 7

Year	Rank	Type	Title / Venue / Authors
2025	A*	`conf`	Using Planning for Automated Testing of Video Games. IJCAI Tomás Balyo, Roman Barták, Lukás Chrpa, Michal Cervenka, Filip Dvorák, Stephan Gocht, Lukás Lipcák, Viktor Macek, Dominik Rohácek, Josef Ryzí, Martin Suda, Dominik Safránek, Slavomír Svancár, G. Michael Youngblood
2024	J	`jnl`	Cloud Kitchen: Using Planning-based Composite AI to Optimize Food Delivery Process. CoRR Slavomír Svancár, Lukás Chrpa, Filip Dvorák, Tomás Balyo
2024	J	`jnl`	Learning Planning Action Models from State Traces. CoRR Tomás Balyo, Martin Suda, Lukás Chrpa, Dominik Safránek, Filip Dvorák, Roman Barták, G. Michael Youngblood
2024	J	`jnl`	On Automating Video Game Testing by Planning and Learning. CoRR Tomás Balyo, G. Michael Youngblood, Filip Dvorák, Roman Barták
2024	A*	`conf`	Planning Domain Model Acquisition from State Traces without Action Parameters. KR Tomás Balyo, Martin Suda, Lukás Chrpa, Dominik Safránek, Stephan Gocht, Filip Dvorák, Roman Barták, G. Michael Youngblood
2023	—	`conf`	Construction of Decision Diagrams for Product Configuration. ConfWS Maxim Popov, Tomás Balyo, Ashlin Iser, Tobias Ostertag
2023	—	`conf`	Decision Heuristics in a Constraint-based Product Configurator. ConfWS Matthias Gorenflo, Tomás Balyo, Ashlin Iser, Tobias Ostertag
2022	—	`conf`	Black-box optimization in a configuration system. SPLC (B) Maximilian Kucher, Tomás Balyo, Noemi Christensen
2022	—	`conf`	Explainable AI for Constraint-Based Expert Systems. Wirtschaftsinformatik Jan Bode, Max Schemmer, Tomás Balyo
2021	C	`conf`	AI Assisted Design of Sokoban Puzzles Using Automated Planning. ArtsIT Tomás Balyo, Nils Froleyks
2021	—	`conf`	Fast Approximate Calculation of Valid Domains in a Satisfiability-based Product Configurator. ConfWS Johannes Werner, Tomás Balyo, Ashlin Iser, Michael Klein
2021	A	`conf`	Parallelizing a SAT-Based Product Configurator. CP Nils Merlin Ullmann, Tomás Balyo, Michael Klein
2021	A	`conf`	Unit Propagation with Stable Watches (Short Paper). CP Ashlin Iser, Tomás Balyo
2019	—	`conf`	Efficient SAT Encodings for Hierarchical Planning. ICAART (2) Dominik Schreiber, Damien Pellier, Humbert Fiorino, Tomás Balyo
2019	B	`conf`	Finding Optimal Longest Paths by Dynamic Programming in Parallel. SOCS Kai Fieger, Tomás Balyo, Christian Schulz, Dominik Schreiber
2019	J	`jnl`	Finding Optimal Longest Paths by Dynamic Programming in Parallel. CoRR Kai Fieger, Tomás Balyo, Christian Schulz, Dominik Schreiber
2019	B	`conf`	Memory Efficient Parallel SAT Solving with Inprocessing. ICTAI Ashlin Iser, Tomás Balyo, Carsten Sinz
2019	B	`conf`	PASAR - Planning as Satisfiability with Abstraction Refinement. SOCS Nils Christian Froleyks, Tomás Balyo, Dominik Schreiber
2019	A*	`conf`	Tree-REX: SAT-Based Tree Exploration for Efficient and High-Quality HTN Planning. ICAPS Dominik Schreiber, Damien Pellier, Humbert Fiorino, Tomás Balyo
2019	C	`conf`	Using DimSpec for Bounded and Unbounded Software Model Checking. ICFEM Marko Kleine Büning, Tomás Balyo, Carsten Sinz
2018	—	`ch.`	Parallel Satisfiability. Handbook of Parallel Constraint Reasoning Tomás Balyo, Carsten Sinz
2018	J	`jnl`	Unbounded Software Model Checking with Incremental SAT-Solving. CoRR Marko Kleine Büning, Tomás Balyo, Carsten Sinz
2018	B	`conf`	Using Algorithm Configuration Tools to Generate Hard SAT Benchmarks. SOCS Tomás Balyo, Lukás Chrpa
2017	A*	`conf`	Accelerating SAT Based Planning with Incremental SAT Solving. ICAPS Stephan Gocht, Tomás Balyo
2017	J	`jnl`	Optimal Longest Paths by Dynamic Programming. CoRR Tomás Balyo, Kai Fieger, Christian Schulz
2017	A*	`conf`	SAT Competition 2016: Recent Developments. AAAI Tomás Balyo, Marijn J. H. Heule, Matti Järvisalo
2017	B	`conf`	Using an Algorithm Portfolio to Solve Sokoban. SOCS Nils Christian Froleyks, Tomás Balyo
2016	A	`conf`	HordeQBF: A Modular and Massively Parallel QBF Solver. SAT Tomás Balyo, Florian Lonsing
2016	J	`jnl`	HordeQBF: A Modular and Massively Parallel QBF Solver. CoRR Tomás Balyo, Florian Lonsing
2016	J	`jnl`	SAT Race 2015. Artif. Intell. Tomás Balyo, Armin Biere, Ashlin Iser, Carsten Sinz
2015	A	`conf`	HordeSat: A Massively Parallel Portfolio SAT Solver. SAT Tomás Balyo, Peter Sanders, Carsten Sinz
2015	J	`jnl`	HordeSat: A Massively Parallel Portfolio SAT Solver. CoRR Tomás Balyo, Peter Sanders, Carsten Sinz
2015	B	`conf`	No One SATPlan Encoding To Rule Them All. SOCS Tomás Balyo, Roman Barták
2014	A	`conf`	Everything You Always Wanted to Know about Blocked Sets (But Were Afraid to Ask). SAT Tomás Balyo, Andreas Fröhlich, Marijn Heule, Armin Biere
2014	B	`conf`	On Different Strategies for Eliminating Redundant Actions from Plans. SOCS Tomás Balyo, Lukás Chrpa, Asma Kilani
2013	J	`jnl`	Complexity issues related to propagation completeness. Artif. Intell. Martin Babka, Tomás Balyo, Ondrej Cepek, Stefan Gurský, Petr Kucera, Václav Vlcek
2013	B	`conf`	Relaxing the Relaxed Exist-Step Parallel Planning Semantics. ICTAI Tomás Balyo
2013	—	`conf`	Solving SMT Problems with a Costly Decision Procedure by Finding Minimum Satisfying Assignments of Boolean Formulas. SERA (selected papers) Martin Babka, Tomás Balyo, Jaroslav Keznikl
2012	B	`conf`	On Improving Plan Quality via Local Enhancements. SOCS Tomás Balyo, Roman Barták, Pavel Surynek
2012	Misc	`conf`	On hierarchies over the SLUR class. ISAIM Václav Vlcek, Tomás Balyo, Stefan Gurský, Petr Kucera
2012	B	`conf`	Shortening Plans by Local Re-planning. ICTAI Tomás Balyo, Roman Barták, Pavel Surynek