Tractable QBF by knowledge compilation
From MaRDI portal
Publication:5090465
Recommendations
Cites work
- scientific article; zbMATH DE number 1946853 (Why is no real title available?)
- Algorithms for propositional model counting
- Approximation of boolean functions by combinatorial rectangles
- Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems
- Bounded treewidth as a key to tractability of knowledge representation and reasoning
- Clique-width and directed width measures for answer-set programming
- Computational models of argument (COMMA 2010). Proceedings of 3rd conference, Desanzano del Garda, Italy, September 2010.
- Counting truth assignments of formulas of bounded tree-width or clique-width
- Decomposable negation normal form
- Exploiting treewidth for projected model counting and its limits
- Model counting for CNF formulas of bounded modular treewidth
- Model counting for formulas of bounded clique-width
- On compiling CNFs into structured deterministic DNNFs
- QBF as an alternative to Courcelle's theorem
- Solving MaxSAT and \#SAT on structured CNF formulas
- Theory and Applications of Satisfiability Testing
- Treewidth in Verification: Local vs. Global
- Treewidth with a quantifier alternation revisited
- Understanding model counting for \(\beta\)-acyclic 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)
