Local Search for Unsatisfiability

DOI10.1007/11814948_28zbMath1187.68561OpenAlexW1552098422MaRDI QIDQ5756575

Inês Lynce, Steven Prestwich

Publication date: 4 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11814948_28

Mathematics Subject Classification ID

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

Related Items (5)

The Relation Between Complete and Incomplete Search ⋮ Improvements to Hybrid Incremental SAT Algorithms ⋮ An overview of parallel SAT solving ⋮ Finding the Hardest Formulas for Resolution ⋮ Theorem proving as constraint solving with coherent logic

This page was built for publication: Local Search for Unsatisfiability