SAT 2005 - PDF Preprint Papers

SAT 2005 Theory and Applications of Satisfiability Testing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SAT-2005 Paper

click to vote

SAT
2005
Springer

162views Hardware» more SAT 2005»

Heuristics for Fast Exact Model Counting

14 years 5 months ago

Download www.cs.rochester.edu

An important extension of satisﬁability testing is model-counting, a task that corresponds to problems such as probabilistic reasoning and computing the permanent of a Boolean ma...

Tian Sang, Paul Beame, Henry A. Kautz

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	162	Heuristics for Fast Exact Model Counting	claim
2	145	A New Approach to Model Counting	claim
3	142	Optimizations for Compiling Declarative Models into Boolean Formulas	claim
4	138	On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization	claim
5	134	A Clause-Based Heuristic for SAT Solvers	claim
6	133	Solving Over-Constrained Problems with SAT Technology	claim
7	129	On Finding All Minimally Unsatisfiable Subformulas	claim
8	124	An Improved Upper Bound for SAT	claim
9	123	Bounded Model Checking with QBF	claim
10	122	A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas	claim
11	117	A Branching Heuristics for Quantified Renamable Horn Formulas	claim
12	115	Improved Exact Solvers for Weighted Max-SAT	claim
13	111	On Subsumption Removal and On-the-Fly CNF Simplification	claim
14	107	Local and Global Complete Solution Learning Methods for QBF	claim
15	104	Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming	claim
16	98	Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable	claim
17	95	Input Distance and Lower Bounds for Propositional Resolution Proof Length	claim
18	95	Random Walk with Continuously Smoothed Variable Weights	claim
19	93	Resolution Tunnels for Improved SAT Solver Performance	claim
20	91	Threshold Behaviour of WalkSAT and Focused Metropolis Search on Random 3-Satisfiability	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers