Theory and Applications of Satisfiability Testing

DOI10.1007/b95238zbMath1204.68202OpenAlexW2494235144WikidataQ56039662 ScholiaQ56039662MaRDI QIDQ5325880

Oliver Kullmann

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

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

How Many Conflicts Does It Need to Be Unsatisfiable? ⋮ Are hitting formulas hard for resolution? ⋮ Irreducible subcube partitions ⋮ New width parameters for SAT and \#SAT

This page was built for publication: Theory and Applications of Satisfiability Testing