You have Guest access.
Log In
Armin Biere and Carla P. Gomes
Front matter
1-9
From Propositional Satisfiability to Satisfiability Modulo Theories
10
CSPs: Adding Structure to SAT
11-21
Complexity of Semialgebraic Proofs with Restricted Degree of Falsity
22-35
Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel
36-41
A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
42-47
Minimum Witnesses for Unsatisfiable 2CNFs
48-53
Preliminary Report on Input Cover Number as a Metric for Propositional Resolution Proofs
54-60
Extended Resolution Proofs for Symbolic SAT Solving with Quantification
61-74
Encoding CNFs to Empower Component Analysis
75-89
Satisfiability Checking of Non-clausal Formulas Using General Matings
90-95
Determinization of Resolution by an Algorithm Operating on Complete Assignments
96-101
A Complete Random Jump Strategy with Guiding Paths
102-115
Applications of SAT Solvers to Cryptanalysis of Hash Functions
116-129
Functional Treewidth: Bounding Complexity in the Presence of Functional Dependencies
130-135
Encoding the Satisfiability of Modal and Description Logics into SAT: The Case Study of K(m)/ALC\mathcal{ALC}
136-141
SAT in Bioinformatics: Making the Case with Haplotype Inference
142-155
Lemma Learning in SMT on Linear Constraints
156-169
On SAT Modulo Theories and Optimization Problems
170-183
Fast and Flexible Difference Constraint Propagation for DPLL(T)
184-197
A Progressive Simplifier for Satisfiability Modulo Theories
198-211
Dependency Quantified Horn Formulas: Models and Complexity
212-225
On Linear CNF Formulas
226-239
A Dichotomy Theorem for Typed Constraint Satisfaction Problems
240-251
A Complete Calculus for Max-SAT
252-265
On Solving the Partial MAX-SAT Problem
266-276
MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(2n)\mathcal{O}(2^n) Time
277-282
Average-Case Analysis for the MAX-2SAT Problem
283-296
Local Search for Unsatisfiability
297-310
Efficiency of Local Search
311-324
Implementing Survey Propagation on Graphics Processing Units
325-338
Characterizing Propagation Methods for Boolean Satisfiability
339-352
Minimal False Quantified Boolean Formulas
353-367
Binary Clause Reasoning in QBF
368-381
Solving Quantified Boolean Formulas with Circuit Observability Don’t Cares
382-395
QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency
396-409
Solving #SAT Using Vertex Covers
410-423
Counting Models in Integer Domains
424-429
sharpSAT – Counting Models with Advanced Component Caching and Implicit BCP
430-435
A Distribution Method for Solving SAT in Grids
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