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