People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
Asksat
A General Theoretical Framework for Learning Smallest Interpretable Models
Stefan Szeider
PDF
Cite
Project
Project
Project
DOI
Backdoors to Satisfaction Continued
Stefan Szeider
PDF
Cite
Project
DOI
Graph Choosability via SAT: Beyond the Nullstellensatz
Markus Kirchweger
,
Tomas Peitl
,
David Seka
,
Stefan Szeider
Cite
Project
Project
OBDDs, SDDs, and Circuits of Bounded Width: Completeness Matters
Stefan Szeider
PDF
Cite
Project
Project
Project
DOI
Breaking Symmetries in Quantified Graph Search: A Comparative Study
Markus Kirchweger
PDF
Cite
Project
Project
DOI
Generating Streamlining Constraints with Large Language Models
Florentina Voboril
,
Vaidyanathan Peruvemba Ramaswamy
,
Stefan Szeider
Cite
Project
Project
Project
SAT Modulo Symmetries: A Survey
Stefan Szeider
PDF
Cite
Project
Project
StreamLLM: Enhancing Constraint Programming with Large Language Model-Generated Streamliners
Florentina Voboril
,
Peruvemba Ramaswamy, Vaidyanathan
,
Stefan Szeider
PDF
Cite
Project
Project
Project
DOI
The 3-Decomposition Conjecture: A SAT-Based Approach with Specialized Propagators
Stefan Szeider
PDF
Cite
Project
Project
DOI
Compilation and Fast Model Counting beyond CNF
Alexis De Colnet
,
Stefan Szeider
,
Tianwei Zhang
Cite
Project
Project
Project
DOI
»
Cite
×