Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning

DOI10.1007/978-3-540-79719-7_24zbMath1138.68554OpenAlexW1600002932MaRDI QIDQ3502713

Zbigniew Stachniak, Anton Belov

Publication date: 27 May 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-79719-7_24

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• UBCSAT

Cites Work

• Unnamed Item
• Unnamed Item
• Local search algorithms for SAT: an empirical evaluation
• An overview of backtrack search satisfiability algorithms
• Variable Dependency in Local Search: Prevention Is Better Than Cure
• Theory and Applications of Satisfiability Testing

This page was built for publication: Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning