Tractable QBF by knowledge compilation
From MaRDI portal
Publication:5090465
DOI10.4230/LIPICS.STACS.2019.18MaRDI QIDQ5090465FDOQ5090465
Authors: Florent Capelli, Stefan Mengel 
Publication date: 18 July 2022
Recommendations
Cites Work
- Algorithms for propositional model counting
- Counting truth assignments of formulas of bounded tree-width or clique-width
- Title not available (Why is that?)
- 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
- Model counting for CNF formulas of bounded modular treewidth
- Computational models of argument (COMMA 2010). Proceedings of 3rd conference, Desanzano del Garda, Italy, September 2010.
- Bounded treewidth as a key to tractability of knowledge representation and reasoning
- Approximation of boolean functions by combinatorial rectangles
- On compiling CNFs into structured deterministic DNNFs
- Understanding model counting for \(\beta\)-acyclic CNF-formulas
- Exploiting treewidth for projected model counting and its limits
- QBF as an alternative to Courcelle's theorem
- Treewidth with a quantifier alternation revisited
- Clique-width and directed width measures for answer-set programming
- Model counting for formulas of bounded clique-width
- Solving MaxSAT and \#SAT on structured CNF formulas
Cited In (3)
This page was built for publication: Tractable QBF by knowledge compilation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090465)
