Generating random instances of weighted model counting. An empirical analysis with varying primal treewidth

DOI10.1007/978-3-031-33271-5_26OpenAlexW4377231267MaRDI QIDQ6080986

Paulius Dilkas

Publication date: 4 October 2023

Published in: Integration of Constraint Programming, Artificial Intelligence, and Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-33271-5_26

zbMATH Keywords

parameterised complexityrandom modelweighted model counting

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating SAT instances with community structure
• Fundamentals of parameterized complexity
• Graph minors. III. Planar tree-width
• Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
• Graph minors. X: Obstructions to tree-decomposition
• Random 3-SAT: The plot thickens
• Weighted model counting without parameter variables
• ProCount: weighted projected model counting with graded project-join trees
• On probabilistic inference by weighted model counting
• Compiling relational Bayesian networks for exact inference
• Exploiting local and repeated structure in dynamic Bayesian networks
• Taming high treewidth with abstraction, nested dynamic programming, and database technology
• Experimental results on the crossover point in random 3-SAT
• An Analysis of Backtracking with Search Rearrangement
• The Number of Satisfying Assignments of Random Regulark-SAT Formulas
• On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
• Jdrasil: A Modular Library for Computing Tree Decompositions
• Inference and learning in probabilistic logic programs using weighted Boolean formulas
• Quantum Weighted Model Counting
• Counting Solutions to Random CNF Formulas
• Theory and Applications of Satisfiability Testing
• Decomposable negation normal form
• Theory and Applications of Satisfiability Testing
• Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution

This page was built for publication: Generating random instances of weighted model counting. An empirical analysis with varying primal treewidth