A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas

Maher N. Mneimneh, Inês Lynce, Zaher S. Andraus, João P. Marques Silva, Karem A. Sakallah. A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas. In Fahiem Bacchus, Toby Walsh, editors, Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005, St. Andrews, UK, June 19-23, 2005, Proceedings. Volume 3569 of Lecture Notes in Computer Science, pages 467-474, Springer, 2005. [doi]

Abstract

Abstract is missing.