In computer science, GSAT and WalkSat are local search algorithms to solve Boolean satisfiability problems. Both algorithms work on formulae inâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Amin Coja-Oghlan, Amir Haqshenas, Samuel Hetterich
- SIAM J. Discrete Math.
- 2017

Partly on the basis of heuristic arguments from physics, it has been suggested that the performance of certain types ofâ€¦Â (More)

Is this relevant?

2015

2015

- Sixue Liu
- ArXiv
- 2015

Stochastic local search (SLS) algorithms have exhibited great effectiveness in finding models of random instances of the Booleanâ€¦Â (More)

Is this relevant?

2015

2015

- Shaowei Cai, Chuan Luo, Kaile Su
- Comput. J.
- 2015

Stochastic local search (SLS) algorithms are well known for their ability to efficiently find models of random instances of theâ€¦Â (More)

Is this relevant?

2012

2012

- Amin Coja-Oghlan, Alan M. Frieze
- ANALCO
- 2012

Let Î¦ be a uniformly distributed random k-SAT formula with n variables and m clauses. We prove that the Walksat algorithm fromâ€¦Â (More)

Is this relevant?

2011

2011

- Alberto Griggio, Quoc-Sang Phan, Roberto Sebastiani, Silvia Tomasi
- FroCoS
- 2011

A dominant approach to Satisfiability Modulo Theories (SMT) relies on the integration of a Conflict-Driven-Clause-Learning (CDCLâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- Sebastian Riedel
- UAI
- 2008

In this work we present Cutting Plane Inference (CPI), a Maximum A Posteriori (MAP) inference method for Statistical Relationalâ€¦Â (More)

Is this relevant?

2005

2005

- Sakari Seitz, Mikko Alava, Pekka Orponen
- SAT
- 2005

An important heuristic in local search algorithms for Satisfiability is focusing, i.e. restricting the selection of flippedâ€¦Â (More)

Is this relevant?

2004

2004

The first convincing demonstration that local search could be used to solve challenging satisfiability problems was provided byâ€¦Â (More)

Is this relevant?

2003

2003

- Alfonso Gerevini, Ivan Serina
- Constraints
- 2003

Graphplan-style of planning can be formulated as an incremental propositional CSP where the (boolean) variables correspond toâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Holger H. Hoos
- AAAI/IAAI
- 2002

Stochastic local search algorithms based on the WalkSAT architecture are among the best known methods for solving hard and largeâ€¦Â (More)

Is this relevant?