Local search characteristics of incomplete SAT procedures

DOI10.1016/S0004-3702(01)00151-5zbMath0983.68180MaRDI QIDQ5958635

Dale Schuurmans, Finnegan Southey

Publication date: 3 March 2002

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

local search; satisfiability; constraint satisfaction; experimental analysis

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68P10: Searching and sorting

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Related Items

Approximate coherence-based reasoning, Local search characteristics of incomplete SAT procedures, Analysis of local search landscapes for \(k\)-SAT instances, Clause weighting local search for SAT, The island confinement method for reducing search space in local search methods, Graph coloring by multiagent fusion search, UnitWalk: A new SAT solver that uses local search guided by unit clause elimination, Understanding the role of noise in stochastic local search: analysis and experiments, Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks, Constraint partitioning in penalty formulations for solving temporal planning problems, The state of SAT, A DECISION PROCEDURE FOR PROBABILITY CALCULUS WITH APPLICATIONS

Cites Work

• Unnamed Item
• Unnamed Item
• A discrete Lagrangian-based global-search method for solving satisfiability problems
• Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
• Local search characteristics of incomplete SAT procedures