Skip to search formSkip to main contentSkip to account menu

WalkSAT

Known as: MaxWalkSat 
In computer science, GSAT and WalkSat are local search algorithms to solve Boolean satisfiability problems. Both algorithms work on formulae in… 
Wikipedia (opens in a new tab)

Related topics

Related topics

15 relations
AlgorithmBart SelmanBoolean satisfiability problemClause (logic)

Broader (4)

Automated theorem provingConstraint programmingLogic in computer scienceOperations research

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Experimental analyses of the K-hidden algorithm
2015
2015
Lifted Symmetry Detection and Breaking for MAP Inference
Symmetry breaking is a technique for speeding up propositional satisfiability testing by adding constraints to the theory that… 
2015
2015
Constructing SAT Filters with a Quantum Annealer
SAT filters are a novel and compact data structure that can be used to quickly query a word for membership in a fixed set. They… 
2009
2009
Integrating Systematic and Local Search Paradigms: A New Strategy for MaxSAT
Systematic search and local search paradigms for combinatorial problems are generally believed to have complementary strengths… 
Highly Cited
2008
Highly Cited
2008
Improving the Accuracy and Efficiency of MAP Inference for Markov Logic
In this work we present Cutting Plane Inference (CPI), a Maximum A Posteriori (MAP) inference method for Statistical Relational… 
Highly Cited
2007
Highly Cited
2007
Stimulus generation for constrained random simulation
Constrained random simulation is the main workhorse in today 's hardware verification flows. It requires the random generation of… 
Highly Cited
2006
Highly Cited
2006
Backtracking Algorithms and Search Heuristics to Generate Test Suites for Combinatorial Testing
Combinatorial covering arrays have been used in several testing approaches. This paper first discusses some existing methods for… 
2002
2002
Accelerating Random Walks
In recent years, there has been much research on local search techniques for solving constraint satisfaction problems, including… 
2000
2000
A Lagrangian reconstruction of GENET
Highly Cited
1998
Highly Cited
1998
Genome rearrangement problems
Various global rearrangements of permutations, such as reversals and transpositions, have recently become of interest because of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)