Theory and Applications of Satisfiability Testing

DOI10.1007/11527695zbMath1122.68595OpenAlexW2483910514MaRDI QIDQ5714776

Oliver Kullmann, Nicola Galesi

Publication date: 16 December 2005

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

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

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

Are hitting formulas hard for resolution? ⋮ Visualizing SAT instances and runs of the DPLL algorithm ⋮ How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms ⋮ New width parameters for SAT and \#SAT

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