Formalizing Dangerous SAT Encodings

DOI10.1007/978-3-540-72788-0_18zbMath1214.68177OpenAlexW1570066695MaRDI QIDQ3612464

Alexander Wolfgang Karl Kurt Hertel, Alasdair Urquhart, Philipp Hertel

Publication date: 10 March 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-72788-0_18

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Complexity of proofs (03F20)

Related Items (4)

Curriculum-based course timetabling with SAT and MaxSAT ⋮ New Encodings of Pseudo-Boolean Constraints into CNF ⋮ A Logical Autobiography ⋮ Chinese remainder encoding for Hamiltonian cycles

This page was built for publication: Formalizing Dangerous SAT Encodings