Local search characteristics of incomplete SAT procedures

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

Finnegan Southey, Dale Schuurmans

Publication date: 3 March 2002

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

zbMATH Keywords

local searchsatisfiabilityconstraint satisfactionexperimental analysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (15)

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

Cites Work

• 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
• Unnamed Item
• Unnamed Item

This page was built for publication: Local search characteristics of incomplete SAT procedures