Theory and Applications of Satisfiability Testing

DOI10.1007/b95238zbMath1204.68202WikidataQ56039662 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

05C90: Applications of graph theory

68R10: Graph theory (including graph drawing) in computer science

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

Related Items

How Many Conflicts Does It Need to Be Unsatisfiable?