SAT 2007 - PDF Preprint Papers

SAT 2007 Theory and Applications of Satisfiability Testing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SAT-2007 Paper

click to vote

SAT
2007
Springer

184views Hardware» more SAT 2007»

Circuit Based Encoding of CNF Formula

13 years 10 months ago

Download www.cril.univ-artois.fr

In this paper a new circuit sat based encoding of boolean formula is proposed. It makes an original use of the concept of restrictive models introduced by Boufkhad to polynomially ...

Gilles Audemard, Lakhdar Sais

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	184	Circuit Based Encoding of CNF Formula	claim
2	181	Breaking Symmetries in SAT Matrix Models	claim
3	146	Algorithms for Variable-Weighted 2-SAT and Dual Problems	claim
4	129	Minimum 2CNF Resolution Refutations in Polynomial Time	claim
5	126	Sensor Deployment for Failure Diagnosis in Networked Aerial Robots: A Satisfiability-Based Approach	claim
6	121	Applying Logic Synthesis for Speeding Up SAT	claim
7	121	MiniMaxSat: A New Weighted Max-SAT Solver	claim
8	118	Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities	claim
9	110	Dynamically Partitioning for Solving QBF	claim
10	107	Combining Adaptive Noise and Look-Ahead in Local Search for SAT	claim
11	99	Horn Upper Bounds and Renaming	claim
12	96	From Idempotent Generalized Boolean Assignments to Multi-bit Search	claim
13	95	Towards a Better Understanding of the Functionality of a Conflict-Driven SAT Solver	claim
14	95	Solving Multi-objective Pseudo-Boolean Problems	claim
15	94	Variable Dependency in Local Search: Prevention Is Better Than Cure	claim
16	92	Mapping CSP into Many-Valued SAT	claim
17	85	Effective Incorporation of Double Look-Ahead Procedures	claim
18	81	Short XORs for Model Counting: From Theory to Practice	claim
19	81	On the Boolean Connectivity Problem for Horn Relations	claim
20	76	Satisfiability with Exponential Families	claim
21	75	Matched Formulas and Backdoor Sets	claim
22	73	SAT Solving for Termination Analysis with Polynomial Interpretations	claim
23	68	A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers