Stebėti
Tomas Balyo
Tomas Balyo
Filuta AI
Patvirtintas el. paštas filuta.ai - Pagrindinis puslapis
Pavadinimas
Cituota
Cituota
Metai
SAT competition 2016: Recent developments
T Balyo, M Heule, M Jarvisalo
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
1242017
Hordesat: A massively parallel portfolio SAT solver
T Balyo, P Sanders, C Sinz
Theory and Applications of Satisfiability Testing--SAT 2015: 18th …, 2015
1182015
SAT race 2015
T Balyo, A Biere, M Iser, C Sinz
Artificial Intelligence 241, 45-65, 2016
752016
Gimsatul, IsaSAT and Kissat entering the SAT competition 2022
A Biere, M Fleury
Proc. of SAT Competition, 10-11, 2022
512022
Tree-REX: SAT-based tree exploration for efficient and high-quality HTN planning
D Schreiber, D Pellier, H Fiorino, T Balyo
Proceedings of the International Conference on Automated Planning and …, 2019
372019
The sat competition 2014
A Belov, D Diepold, M Heule, M Järvisalo
Proc. SAT COMPETITION, 45, 2014
322014
Parallel satisfiability
T Balyo, C Sinz
Handbook of Parallel Constraint Reasoning, 3-29, 2018
302018
Accelerating SAT based planning with incremental SAT solving
S Gocht, T Balyo
Proceedings of the International Conference on Automated Planning and …, 2017
302017
Relaxing the relaxed exist-step parallel planning semantics
T Balyo
2013 IEEE 25th International Conference on Tools with Artificial …, 2013
252013
Everything you always wanted to know about blocked sets (but were afraid to ask)
T Balyo, A Fröhlich, MJH Heule, A Biere
Theory and Applications of Satisfiability Testing–SAT 2014: 17th …, 2014
242014
Proceedings of sat competition 2020: Solver and benchmark descriptions
T Balyo, N Froleyks, MJH Heule, M Iser, M Järvisalo, M Suda
Department of Computer Science, University of Helsinki, 2020
222020
Complexity issues related to propagation completeness
M Babka, T Balyo, O Čepek, Š Gurský, P Kučera, V Vlček
Artificial Intelligence 203, 19-34, 2013
222013
On different strategies for eliminating redundant actions from plans
T Balyo, L Chrpa, A Kilani
Proceedings of the International Symposium on Combinatorial Search 5 (1), 10-18, 2014
182014
Hordeqbf: A modular and massively parallel QBF solver
T Balyo, F Lonsing
International Conference on Theory and Applications of Satisfiability …, 2016
142016
Using algorithm configuration tools to generate hard SAT benchmarks
T Balyo, L Chrpa
Proceedings of the International Symposium on Combinatorial Search 9 (1 …, 2018
132018
The international SAT Competitions web page
M Heule, M Järvisalo, M Suda, T Balyo, C Sinz, A Biere
122019
SAT Competition 2017–Solver and Benchmark Descriptions
T Balyo, MJH Heule, M Järvisalo
Proceedings of SAT COMPETITION 2017, 14-15, 2017
122017
Shortening plans by local re-planning
T Balyo, R Bartak, P Surynek
2012 IEEE 24th International Conference on Tools with Artificial …, 2012
112012
On hierarchies over the SLUR class
T Balyo, Š Gurský, P Kucera, V Vlcek
Twelfth International Symposium on Artificial Intelligence and Mathematics …, 2012
102012
Using an algorithm portfolio to solve Sokoban
N Froleyks, T Balyo
Proceedings of the International Symposium on Combinatorial Search 8 (1 …, 2017
92017
Sistema negali atlikti operacijos. Bandykite vėliau dar kartą.
Straipsniai 1–20