SAT 2009 - PDF Preprint Papers

SAT 2009 Theory and Applications of Satisfiability Testing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SAT-2009 Paper

click to vote

SAT
2009
Springer

158views Hardware» more SAT 2009»

Beyond CNF: A Circuit-Based QBF Solver

14 years 7 months ago

Download www.cs.toronto.edu

State-of-the-art solvers for Quantiﬁed Boolean Formulas (QBF) have employed many techniques from the ﬁeld of Boolean Satisﬁability (SAT) including the use of Conjunctive Norm...

Alexandra Goultiaeva, Vicki Iverson, Fahiem Bacchu...

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	158	Beyond CNF: A Circuit-Based QBF Solver	claim
2	153	Does Advice Help to Prove Propositional Tautologies?	claim
3	132	Relaxed DPLL Search for MaxSAT	claim
4	126	Extending SAT Solvers to Cryptographic Problems	claim
5	124	Cardinality Networks and Their Applications	claim
6	121	The Complexity of Reasoning for Fragments of Default Logic	claim
7	119	Boundary Points and Resolution	claim
8	119	Backdoors in the Context of Learning	claim
9	118	Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability	claim
10	117	Dynamic Symmetry Breaking by Simulating Zykov Contraction	claim
11	113	Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution	claim
12	113	Exploiting Cycle Structures in Max-SAT	claim
13	111	Restart Strategy Selection Using Machine Learning Techniques	claim
14	109	A Compact Representation for Syntactic Dependencies in QBFs	claim
15	108	On-the-Fly Clause Improvement	claim
16	103	Instance-Based Selection of Policies for SAT Solvers	claim
17	97	Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates	claim
18	95	Finding Lean Induced Cycles in Binary Hypercubes	claim
19	94	Sequential Encodings from Max-CSP into Partial Max-SAT	claim
20	94	Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences	claim
21	94	Nonlinear Pseudo-Boolean Optimization: Relaxation or Propagation?	claim
22	91	VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search	claim
23	90	Solving (Weighted) Partial MaxSAT through Satisfiability Testing	claim
24	87	A Novel Approach to Combine a SLS- and a DPLL-Solver for the Satisfiability Problem	claim
25	82	Generalizing Core-Guided Max-SAT	claim
26	79	Minimizing Learned Clauses	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers