UnitWalk
From MaRDI portal
Cited in
(48)- SatEx
- GridLab
- GridSAT
- SATLIB
- UBCSAT
- Walksat
- Machine learning-based restart policy for CDCL SAT solvers
- SATO
- QingTing1
- PBS
- Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances
- On SAT instance classes and a method for reliable performance experiments with SAT solvers
- A SAT approach to query optimization in mediator systems
- GrADS
- BerkMin
- The analysis of expected fitness and success ratio of two heuristic optimizations on two bimodal MaxSat problems
- GrADSAT
- An improved algorithm for the (n, 3)-MaxSAT problem: asking branchings to satisfy the clauses
- Jerusat
- QBFLIB
- NAGSAT
- ZetaSAT
- A taxonomy of exact methods for partial Max-SAT
- GridSAT: Design and implementation of a computational grid application
- Velev SAT Benchmarks
- The state of SAT
- Locality and hard SAT-instances
- A Decision-Making Procedure for Resolution-Based SAT-Solvers
- Bounds-Consistent Local Search
- scientific article; zbMATH DE number 5510692 (Why is no real title available?)
- A switching criterion for intensification and diversification in local search for SAT
- From Idempotent Generalized Boolean Assignments to Multi-bit Search
- scientific article; zbMATH DE number 1961995 (Why is no real title available?)
- scientific article; zbMATH DE number 1927173 (Why is no real title available?)
- Improved local search for circuit satisfiability
- Boosting local search thanks to \textsc{cdcl}
- Decision procedures. An algorithmic point of view
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Phase transitions in machine learning.
- Justification-Based Local Search with Adaptive Noise Strategies
- Algorithmic Applications in Management
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Artificial Evolution
- Determinization of Resolution by an Algorithm Operating on Complete Assignments
- A parallelization scheme based on work stealing for a class of SAT solvers
- A comparative runtime analysis of heuristic algorithms for satisfiability problems
This page was built for software: UnitWalk