232 citations · 250 across the 9 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2025
On complexity of restricted fragments of Decision DNNF
Andrea Calí, Igor Razgon
Decision \textsc{dnnf} (a.k.a. -\textsc{fbdd}) is an important special case of Decomposable Negation Normal Form (\textsc{dnnf}), a landmark knowledge compilation model.…
cs.CC2019
Regular resolution for CNFs with almost bounded one-sided treewidth
Andrea Cali, Igor Razgon
We introduce a one-sided incidence tree decomposition of a CNF . This is a tree decomposition of the incidence graph of where the underlying tree is rooted and the set of ba…