1 citations · 1 across the 6 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
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
Understanding CDCL Solvers via Scalability Studies and Proofdoors
Shimin Zhang, Yechuan Xia, Chunxiao Li +3
Over the past several decades, CDCL SAT solvers have proven remarkably effective on large industrial formulas, despite SAT being NP-complete and widely believed to be intractable.…