Approximate Model Counting via Extension Rule
From MaRDI portal
Publication:3452569
DOI10.1007/978-3-319-19647-3_22zbMath1356.68109OpenAlexW2399637032MaRDI QIDQ3452569
Jingli Wu, Jinyan Wang, Minghao Yin
Publication date: 12 November 2015
Published in: Frontiers in Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-19647-3_22
Analysis of algorithms and problem complexity (68Q25) Mechanization of proofs and logical operations (03B35) Classical propositional logic (03B05) Approximation algorithms (68W25)
Uses Software
Cites Work
- Planning as satisfiability: heuristics
- Leveraging belief propagation, backtrack search, and statistics for model counting
- Random generation of combinatorial structures from a uniform distribution
- Approximate inclusion-exclusion
- Inclusion-exclusion: exact and approximate
- Theorem proving based on the extension rule
- Towards a theory of random walk planning: Regress factors, fair homogeneous graphs and extensions
- Exploiting Structure in Weighted Model Counting Approaches to Probabilistic Inference
- Solving #SAT Using Extension Rules
- CNF-Satisfiability Test by Counting and Polynomial Average Time
- A machine program for theorem-proving
- Theory and Applications of Satisfiability Testing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Approximate Model Counting via Extension Rule