3 papers
cs.LO2026
On-the-fly LTLf Synthesis under Partial Observability
Nadav Alon, Supratik Chakraborty, Alexandre Duret-Lutz +4
LTLf synthesis under partial observability requires reasoning about unobservable environment variables, which is typically handled by constructing a belief-state DFA via subset con…
cs.LO2026
Efficient Incremental #SAT via Cross-Instance Knowledge Reuse
Uriya Bartal, Dror Fried, Jean-Marie Lagniez
Model counting () is a fundamental yet -complete problem central to probabilistic reasoning. In this work, we address \textit{incremental model counting},…
cs.LO2025
Algorithmic Perspective on Toda's Theorem
Dror Fried, Etay Segal, Gad E. Yaron
Toda's Theorem is a fundamental result in computational complexity theory, whose proof relies on a reduction from a QBF problem with a constant number of quantifiers to a model cou…