Theory and Applications of Satisfiability Testing

From MaRDI portal
Revision as of 04:44, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5714764

DOI10.1007/11527695zbMath1122.68620OpenAlexW2483910514MaRDI QIDQ5714764

Holger H. Hoos, Dave A. D. Tompkins

Publication date: 16 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11527695




Related Items (23)

Stochastic Local Search for SMT: Combining Theory Solvers with WalkSATSATenstein: automatically building local search SAT solvers from componentsNew local search methods for partial MaxSATSimulating circuit-level simplifications on CNFOn the van der Waerden numbers \(\mathrm{w}(2; 3, t)\)Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause LearningSolving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary resultsAn iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problemBreaking Cycle Structure to Improve Lower Bound for Max-SATDecomposing SAT Instances with Pseudo BackbonesCaptain Jack: New Variable Selection Heuristics in Local Search for SATSolving hybrid Boolean constraints in continuous space via multilinear Fourier expansionsEfficient branch-and-bound algorithms for weighted MAX-2-SATImproved haplotype assembly using Xor genotypesGlobal versus local search: the impact of population sizes on evolutionary algorithm performanceProbabilistic characterization of random Max \(r\)-SatThe Normalized Autocorrelation Length of Random Max  $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$Cooperative parallel SAT local search with path relinkingUBCSATEfficiently Calculating Evolutionary Tree Measures Using SATUsing the method of conditional expectations to supply an improved starting point for CCLSahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT SolverIterative and core-guided maxsat solving: a survey and assessment


Uses Software





This page was built for publication: Theory and Applications of Satisfiability Testing