SAT 2004 - PDF Preprint Papers

SAT 2004 Theory and Applications of Satisfiability Testing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SAT-2004 Paper

click to vote

SAT
2004
Springer

158views Hardware» more SAT 2004»

Aligning CNF- and Equivalence-Reasoning

13 years 9 months ago

Download www.satisfiability.org

Structural logical formulas sometimes yield a substantial fraction of so called equivalence clauses after translating to CNF. The best known example of this feature is probably pro...

Marijn Heule, Hans van Maaren

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	Aligning CNF- and Equivalence-Reasoning	claim
2	158	Combining Component Caching and Clause Learning for Effective Model Counting	claim
3	131	A Comparative Study of 2QBF Algorithms	claim
4	117	A Random Constraint Satisfaction Problem That Seems Hard for DPLL	claim
5	115	Full CNF Encoding: The Counting Constraints Case	claim
6	113	Clause Form Conversions for Boolean Circuits	claim
7	111	A Note on Satisfying Truth-Value Assignments of Boolean Formulas	claim
8	109	A SAT-Based Decision Procedure for the Boolean Combination of Difference Constraints	claim
9	109	Resolve and Expand	claim
10	107	Solving Non-clausal Formulas with DPLL search	claim
11	106	Local Search with Bootstrapping	claim
12	106	The Optimality of a Fast CNF Conversion and its Use with SAT	claim
13	102	Derandomization of Schuler's Algorithm for SAT	claim
14	101	Detecting Backdoor Sets with Respect to Horn and Binary Clauses	claim
15	101	An Algebraic Approach to the Complexity of Generalized Conjunctive Queries	claim
16	99	Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables	claim
17	97	Incremental Compilation-to-SAT Procedures	claim
18	97	Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization	claim
19	95	Fifty-Five Solvers in Vancouver: The SAT 2004 Competition	claim
20	95	Local Search for Very Large SAT Problems	claim
21	94	QBF Reasoning on Real-World Instances	claim
22	90	Encoding Global Unobservability for Efficient Translation to SAT	claim
23	89	Using Rewarding Mechanisms for Improving Branching Heuristics	claim
24	88	Improving First-order Model Searching by Propositional Reasoning and Lemma Learning	claim
25	85	Visualizing the Internal Structure of SAT Instances (Preliminary Report)	claim
26	83	Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank	claim
27	75	The Second QBF Solvers Comparative Evaluation	claim
28	73	A SAT Based Scheduler for Tournament Schedules	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers