scientific article; zbMATH DE number 7559127
From MaRDI portal
Publication:5090465
DOI10.4230/LIPIcs.STACS.2019.18MaRDI QIDQ5090465
Stefan Mengel, Florent Capelli
Publication date: 18 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Solving projected model counting by utilizing treewidth and its limits ⋮ Connecting knowledge compilation classes and width parameters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Model counting for CNF formulas of bounded modular treewidth
- Approximation of boolean functions by combinatorial rectangles
- Exploiting treewidth for projected model counting and its limits
- QBF as an alternative to Courcelle's theorem
- Algorithms for propositional model counting
- Bounded treewidth as a key to tractability of knowledge representation and reasoning
- Counting truth assignments of formulas of bounded tree-width or clique-width
- Model Counting for Formulas of Bounded Clique-Width
- Solving MaxSAT and #SAT on Structured CNF Formulas
- On Compiling CNFs into Structured Deterministic DNNFs
- Clique-Width and Directed Width Measures for Answer-Set Programming
- Theory and Applications of Satisfiability Testing
- Treewidth in Verification: Local vs. Global
- Decomposable negation normal form
- Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems
This page was built for publication:
