Theory and applications of satisfiability testing -- SAT 2009. 12th international conference, SAT 2009, Swansea, UK, June 30--July 3, 2009. Proceedings

DOI10.1007/978-3-642-02777-2zbMath1165.68014OpenAlexW1594550269MaRDI QIDQ1027644

No author found.

Publication date: 30 June 2009

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-02777-2

Mathematics Subject Classification ID

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)

Propositional SAT Solving ⋮ Anytime answer set optimization via unsatisfiable core shrinking ⋮ The configurable SAT solver challenge (CSSC)

This page was built for publication: Theory and applications of satisfiability testing -- SAT 2009. 12th international conference, SAT 2009, Swansea, UK, June 30--July 3, 2009. Proceedings