Theory and applications of satisfiability testing -- SAT 2012. 15th international conference, Trento, Italy, June 17--20, 2012. Proceedings

DOI10.1007/978-3-642-31612-8zbMath1268.68009OpenAlexW2489418233WikidataQ62041205 ScholiaQ62041205MaRDI QIDQ428474

No author found.

Publication date: 22 June 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-31612-8

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (6)

SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers ⋮ A review of literature on parallel constraint solving ⋮ The configurable SAT solver challenge (CSSC) ⋮ Automatic construction of parallel portfolios via algorithm configuration ⋮ Definability for model counting ⋮ Expansion-based QBF solving versus Q-resolution

This page was built for publication: Theory and applications of satisfiability testing -- SAT 2012. 15th international conference, Trento, Italy, June 17--20, 2012. Proceedings