Variable Dependency in Local Search: Prevention Is Better Than Cure

DOI10.1007/978-3-540-72788-0_14zbMath1214.68369OpenAlexW1492052509MaRDI QIDQ3612460

Steven Prestwich

Publication date: 10 March 2009

Published in: Theory and Applications of Satisfiability Testing – SAT 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72788-0_14

Mathematics Subject Classification ID

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

Related Items (4)

Propositional SAT Solving ⋮ Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms ⋮ Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning ⋮ Iterative and core-guided maxsat solving: a survey and assessment

Uses Software

• UBCSAT

This page was built for publication: Variable Dependency in Local Search: Prevention Is Better Than Cure