UBCSAT
From MaRDI portal
Software:15153
No author found.
Source code repository: https://github.com/dtompkins/ubcsat
Related Items
Stochastic Local Search for SMT: Combining Theory Solvers with WalkSAT ⋮ SATenstein: automatically building local search SAT solvers from components ⋮ New local search methods for partial MaxSAT ⋮ Simulating circuit-level simplifications on CNF ⋮ On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\) ⋮ Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning ⋮ Unnamed Item ⋮ Pitfalls and Best Practices in Algorithm Configuration ⋮ Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results ⋮ An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem ⋮ Breaking Cycle Structure to Improve Lower Bound for Max-SAT ⋮ Theory and Applications of Satisfiability Testing ⋮ Theory and Applications of Satisfiability Testing ⋮ Decomposing SAT Instances with Pseudo Backbones ⋮ Captain Jack: New Variable Selection Heuristics in Local Search for SAT ⋮ Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions ⋮ Efficient branch-and-bound algorithms for weighted MAX-2-SAT ⋮ Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT ⋮ Green-Tao Numbers and SAT ⋮ Improved haplotype assembly using Xor genotypes ⋮ Global versus local search: the impact of population sizes on evolutionary algorithm performance ⋮ Sequential Model-Based Parameter Optimization: an Experimental Investigation of Automated and Interactive Approaches ⋮ Symmetry Breaking and Local Search Spaces ⋮ Variable Dependency in Local Search: Prevention Is Better Than Cure ⋮ Combining Adaptive Noise and Look-Ahead in Local Search for SAT ⋮ Probabilistic characterization of random Max \(r\)-Sat ⋮ SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT ⋮ The Normalized Autocorrelation Length of Random Max $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$ ⋮ Cooperative parallel SAT local search with path relinking ⋮ Efficiently Calculating Evolutionary Tree Measures Using SAT ⋮ Principles and Practice of Constraint Programming – CP 2004 ⋮ Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem ⋮ ParamILS: An Automatic Algorithm Configuration Framework ⋮ Unnamed Item ⋮ Justification-Based Local Search with Adaptive Noise Strategies ⋮ Iterative and core-guided maxsat solving: a survey and assessment
This page was built for software: UBCSAT
