Pages that link to "Item:Q2266937"

The following pages link to Algorithms for propositional model counting (Q2266937):

Displaying 29 items.

• Backdoors to q-Horn (Q261394) (← links)
• Model counting for CNF formulas of bounded modular treewidth (Q334935) (← links)
• Satisfiability of acyclic and almost acyclic CNF formulas (Q385062) (← links)
• A new probabilistic constraint logic programming language based on a generalised distribution semantics (Q896427) (← links)
• On the construction of graphs with a planar bipartite double cover from Boolean formulas and its application to counting satisfying solutions (Q1704571) (← links)
• ProCount: weighted projected model counting with graded project-join trees (Q2118296) (← links)
• Generating clause sequences of a CNF formula (Q2219060) (← links)
• On efficiently solvable cases of quantum \(k\)-SAT (Q2223725) (← links)
• New width parameters for SAT and \#SAT (Q2238644) (← links)
• Definability for model counting (Q2303508) (← links)
• On preprocessing techniques and their impact on propositional model counting (Q2362107) (← links)
• Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? (Q2667835) (← links)
• Solving projected model counting by utilizing treewidth and its limits (Q2680775) (← links)
• Backdoors to Satisfaction (Q2908542) (← links)
• An Upper Bound for Resolution Size: Characterization of Tractable SAT Instances (Q2980924) (← links)
• Satisfiability of Acyclic and almost Acyclic CNF Formulas (II) (Q3007673) (← links)
• Community Structure Inspired Algorithms for SAT and #SAT (Q3453228) (← links)
• D-FLAT: Declarative problem solving using tree decompositions and answer-set programming (Q4911127) (← links)
• (Q5005139) (← links)
• (Q5009587) (← links)
• A Study of Symmetry Breaking Predicates and Model Counting (Q5039506) (← links)
• Sum-of-Products with Default Values: Algorithms and Complexity Results (Q5076308) (← links)
• (Q5090465) (← links)
• (Q5090992) (← links)
• (Q5111886) (← links)
• Parameterised complexity of model checking and satisfiability in propositional dependence logic (Q5918486) (← links)
• Default logic and bounded treewidth (Q5918613) (← links)
• Exploiting Database Management Systems and Treewidth for Counting (Q6063876) (← links)
• SAT backdoors: depth beats size (Q6152185) (← links)