Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Symmetry breaking is a technique for speeding up propositional satisfiability testing by adding constraints to the theory that… Expand
  • table 1
Is this relevant?
Highly Cited
2008
Highly Cited
2008
In this work we present Cutting Plane Inference (CPI), a Maximum A Posteriori (MAP) inference method for Statistical Relational… Expand
  • table 1
  • figure 1
  • table 2
  • figure 2
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Markov logic networks (MLNs) combine first-order logic and Markov networks, allowing us to handle the complexity and uncertainty… Expand
  • figure 1
  • table 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
  • J. Yan, J. Zhang
  • 30th Annual International Computer Software and…
  • 2006
  • Corpus ID: 10996774
Combinatorial covering arrays have been used in several testing approaches. This paper first discusses some existing methods for… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Many machine learning applications require a combination of probability and first-order logic. Markov logic networks (MLNs… Expand
  • table 1
  • table 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
In this paper, we show how Guided Local Search (GLS) can be applied to the SAT problem and show how the resulting algorithm can… Expand
  • table I
  • table II
  • table III
  • table III
  • table IV
Is this relevant?
Highly Cited
2002
Highly Cited
2002
  • H. Hoos
  • AAAI/IAAI
  • 2002
  • Corpus ID: 2530656
Stochastic local search algorithms based on the WalkSAT architecture are among the best known methods for solving hard and large… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
A corner bracket for use in mounting and locating a mounting bracket for a window covering including an inverted L-shaped… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Planning is a notoriously hard combinatorial search problem. In many interesting domains, current planning algorithms fail to… Expand
  • table 1
  • table 2
  • table 3
Is this relevant?