Theory and Applications of Satisfiability Testing

DOI10.1007/b95238zbMath1204.68214OpenAlexW2494235144WikidataQ56039662 ScholiaQ56039662MaRDI QIDQ5325856

Linda van Norden, Hans van Maaren

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

zbMATH Keywords

thresholdssatisfiability3-SATHorngraph-3-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

Copy complexity of Horn formulas with respect to unit read-once resolution ⋮ Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances ⋮ Satisfiability of mixed Horn formulas ⋮ On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls

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