A Branch and Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas
Mneimneh, M. N., Lynce, I., Andraus, Z. S., Marques-Silva, J. P. and Sakallah, K. A. (2005) A Branch and Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas. In, International Conference on Theory and Applications of Satisfiability Testing, St. Andrews, UK, International Conference on Theory and Applications of Satisfiability Testing, 467-474.
Download
![[img]](http://eprints.soton.ac.uk/style/images/fileicons/application_pdf.png) |
PDF
Download (219Kb) |
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Additional Information: | Event Dates: June 2005 |
| Related URLs: | |
| Divisions: | Faculty of Physical and Applied Science > Electronics and Computer Science |
| Item ID: | 261996 |
| Date Deposited: | 20 Feb 2006 |
| Last Modified: | 02 Mar 2012 12:59 |
| Contributors: | Mneimneh, M. N. (Author) Lynce, I. (Author) Andraus, Z. S. (Author) Marques-Silva, J. P. (Author) Sakallah, K. A. (Author) Bacchus, F. (Editor) Walsh, T. (Editor) |
| Date: | June 2005 |
| Additional Information: | Event Dates: June 2005 |
| Status: | Published |
| Publisher: | International Conference on Theory and Applications of Satisfiability Testing |
| Further Information: | Google Scholar |
| ISI Citation Count: | 10 |
| URI: | http://eprints.soton.ac.uk/id/eprint/261996 |
Actions (login required)
 |
View Item |
