Theory and Applications of Satisfiability Testing

DOI10.1007/b95238zbMath1204.68189OpenAlexW2494235144WikidataQ56039662 ScholiaQ56039662MaRDI QIDQ5325884

Gilles Dequen, Olivier Dubois

Publication date: 24 July 2009

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

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

Mathematics Subject Classification ID

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

Related Items

The SAT-based approach to separation logic, An efficient approach to solving random \(k\)-SAT problems, On the limit of branching rules for hard random unsatisfiable 3-SAT, Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer, Present and Future of Practical SAT Solving

Uses Software

• kcnfs
• Chaff