Tomáš Peitl
5 papers · 2021–2026 · 2 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+3 more ↓ Show less ↑
🐝 Cross-Pollinator (9) 🧭 Keyword Pioneer 🌍 Conference Polyglot (2) 🏃 Academic Marathon (5) 🌈 Renaissance Researcher (5)
🌉
Interdisciplinary Bridge
🏆
Keyword Champion
(3)
❓
The Questioner
Conferences
IJCAI (3)
AAAI (2)
Top co-authors
Keywords
sat solver
(3)
symmetry breaking
(3)
sat solving
(2)
quantified boolean formula
(2)
proof complexity
(2)
conflict-driven clause learning
(1)
sat encoding
(1)
resolution proof
(1)
cnf formula
(1)
hardness number
(1)
planar graph
(1)
cube learning
(1)
co-np property
(1)
shortest proof
(1)
pure literal elimination
(1)
graph enumeration
(1)
sat modulo symmetries
(1)
combinatorial optimization
(1)
list coloring
(1)
satisfiability solving
(1)
Papers
Graph Choosability via SAT: Beyond the Nullstellensatz
AAAI 2026
Breaking Symmetries in Quantified Graph Search: A Comparative Study
AAAI 2025
Co-Certificate Learning with SAT Modulo Symmetries
IJCAI 2023
QCDCL with Cube Learning or Pure Literal Elimination - What is Best?
IJCAI 2022
Finding the Hardest Formulas for Resolution (Extended Abstract)
IJCAI 2021