UnitWalk

swMATH993MaRDI QIDQ13737

No author found.

Described by source

• UnitWalk: A new SAT solver that uses local search guided by unit clause elimination

Related Items (31)

A comparative runtime analysis of heuristic algorithms for satisfiability problems ⋮ The state of SAT ⋮ Unnamed Item ⋮ Machine learning-based restart policy for CDCL SAT solvers ⋮ Theory and Applications of Satisfiability Testing ⋮ Theory and Applications of Satisfiability Testing ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The analysis of expected fitness and success ratio of two heuristic optimizations on two bimodal MaxSat problems ⋮ A Decision-Making Procedure for Resolution-Based SAT-Solvers ⋮ A taxonomy of exact methods for partial Max-SAT ⋮ Bounds-Consistent Local Search ⋮ Phase Transitions in Machine Learning ⋮ Theory and Applications of Satisfiability Testing ⋮ Theory and Applications of Satisfiability Testing ⋮ Algorithmic Applications in Management ⋮ Artificial Evolution ⋮ Decision procedures. An algorithmic point of view ⋮ Unnamed Item ⋮ Improved Local Search for Circuit Satisfiability ⋮ Boosting Local Search Thanks to cdcl ⋮ 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 ⋮ Determinization of Resolution by an Algorithm Operating on Complete Assignments ⋮ GridSAT: Design and implementation of a computational grid application ⋮ From Idempotent Generalized Boolean Assignments to Multi-bit Search ⋮ An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses ⋮ Justification-Based Local Search with Adaptive Noise Strategies ⋮ A parallelization scheme based on work stealing for a class of SAT solvers

This page was built for software: UnitWalk