1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.CC2025★ 1 cited
Compilation and Fast Model Counting beyond CNF
Alexis de Colnet, Stefan Szeider, Tianwei Zhang
Circuits in deterministic decomposable negation normal form (d-DNNF) are representations of Boolean functions that enable linear-time model counting. This paper strengthens our the…
cs.DM2024
Small unsatisfiable -CNFs with bounded literal occurrence
Tianwei Zhang, Tomáš Peitl, Stefan Szeider
We obtain the smallest unsatisfiable formulas in subclasses of -CNF (exactly distinct literals per clause) with bounded variable or literal occurrences. Smaller unsatisfiabl…