You have Guest access.
Log In
João Marques-Silva and Karem A. Sakallah
Front matter
1-2
SAT: Past and Future
3
Encodings of Problems in Effectively Propositional Logic
4-9
Efficient Circuit to CNF Conversion
10-15
Mapping CSP into Many-Valued SAT
16-21
Circuit Based Encoding of CNF Formula
22-27
Breaking Symmetries in SAT Matrix Models
28-40
Partial Max-SAT Solvers with Clause Learning
41-55
MiniMaxSat: A New Weighted Max-SAT Solver
56-69
Solving Multi-objective Pseudo-Boolean Problems
70-79
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
80-93
Horn Upper Bounds and Renaming
94-99
Matched Formulas and Backdoor Sets
100-106
Short XORs for Model Counting: From Theory to Practice
107-120
Variable Dependency in Local Search: Prevention Is Better Than Cure
121-133
Combining Adaptive Noise and Look-Ahead in Local Search for SAT
134-147
From Idempotent Generalized Boolean Assignments to Multi-bit Search
148-158
Satisfiability with Exponential Families
159-172
Formalizing Dangerous SAT Encodings
173-186
Algorithms for Variable-Weighted 2-SAT and Dual Problems
187-200
On the Boolean Connectivity Problem for Horn Relations
201-214
A First Step Towards a Unified Proof Checker for QBF
215-229
Dynamically Partitioning for Solving QBF
230-243
Backdoor Sets of Quantified Boolean Formulas
244-257
Bounded Universal Expansion for Preprocessing QBF
258-271
Effective Incorporation of Double Look-Ahead Procedures
272-286
Applying Logic Synthesis for Speeding Up SAT
287-293
Towards a Better Understanding of the Functionality of a Conflict-Driven SAT Solver
294-299
A Lightweight Component Caching Scheme for Satisfiability Solvers
300-313
Minimum 2CNF Resolution Refutations in Polynomial Time
314-327
Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices
328-333
Verifying Propositional Unsatisfiability: Pitfalls to Avoid
334-339
A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories
340-354
SAT Solving for Termination Analysis with Polynomial Interpretations
355-368
Fault Localization and Correction with QBF
369-376
Sensor Deployment for Failure Diagnosis in Networked Aerial Robots: A Satisfiability-Based Approach
377-382
Inversion Attacks on Secure Hash Functions Using sat Solvers
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info