You have Guest access.
Log In
Fahiem Bacchus and Toby Walsh
Front matter
60-67
Solving Over-Constrained Problems with SAT Technology
84-90
A Symbolic Search Based Approach for Quantified Boolean Formulas
8-11
Substitutional Definition of Satisfiability in Classical Propositional Logic
649-652
A Clause-Based Heuristic for SAT Solvers
102-104
Effective Preprocessing in SAT Through Variable and Clause Elimination
76-90
Resolution and Pebbling Games
120-121
Local and Global Complete Solution Learning Methods for QBF
113-114
Equivalence Checking of Circuits with Parameterized Specifications
618-625
Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming
135-142
Simulating Cutting Plane Proofs with Restricted Degree of Falsity by Resolution
105-107
Resolution Tunnels for Improved SAT Solver Performance
158-172
Diversification and Determinism in Local Search for Satisfiability
34-42
On Finding All Minimally Unsatisfiable Subformulas
632-637
Optimizations for Compiling Declarative Models into Boolean Formulas
626-631
Random Walk with Continuously Smoothed Variable Weights
138-143
Derandomization of PPSZ for Unique-k-SAT
226-240
Heuristics for Fast Exact Model Counting
68-81
A Scalable Method for Solving Satisfiability of Integer Linear Arithmetic Logic
638-641
DPvis – A Tool to Visualize the Structure of SAT Instances
642-648
Constraint Metrics for Local Search
282-293
Input Distance and Lower Bounds for Propositional Resolution Proof Length
294-308
Sums of Squares, Satisfiability and Maximum Satisfiability
12-22
Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable
96-97
A New Approach to Model Counting
23-33
Benchmarking SAT Solvers for Bounded Model Checking
122-123
Model-Equivalent Reductions
371-377
Improved Exact Solvers for Weighted Max-SAT
378-385
Quantifier Trees for QBFs
614-617
Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas
126-131
A Branching Heuristics for Quantified Renamable Horn Formulas
132-137
An Improved Upper Bound for SAT
100-101
Bounded Model Checking with QBF
415-422
Variable Ordering for Efficient SAT Search by Analyzing Constraint-Variable Dependencies
91-94
Cost-Effective Hyper-Resolution for Preprocessing CNF Formulas
43-59
Automated Generation of Simplification Rules for SAT and MAXSAT
110-112
Speedup Techniques Utilized in Modern SAT Solvers An Analysis in the MIRA Environment
108-109
FPGA Logic Synthesis Using Quantified Boolean Satisfiability
98-99
On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization
372-375
A New Set of Algebraic Benchmark Problems for SAT Solvers
118-119
A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas
115-117
Threshold Behaviour of WalkSAT and Focused Metropolis Search on Random 3-Satisfiability
15-16
On Subsumption Removal and On-the-Fly CNF Simplification
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