Theory and applications of satisfiability testing -- SAT 2011. 14th international conference, SAT 2011, Ann Arbor, MI, USA, June 19--22, 2011. Proceedings

DOI10.1007/978-3-642-21581-0zbMath1215.68023OpenAlexW2490197295MaRDI QIDQ544456

No author found.

Publication date: 14 June 2011

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-21581-0

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 (3)

Hints Revealed ⋮ On Davis-Putnam reductions for minimally unsatisfiable clause-sets ⋮ The configurable SAT solver challenge (CSSC)

This page was built for publication: Theory and applications of satisfiability testing -- SAT 2011. 14th international conference, SAT 2011, Ann Arbor, MI, USA, June 19--22, 2011. Proceedings