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. Bacchus, F. and Walsh, T. (eds.) International Conference on Theory and Applications of Satisfiability Testing. pp. 467-474 .
Record type:
Conference or Workshop Item
(Paper)
More information
Published date: June 2005
Additional Information:
Event Dates: June 2005
Venue - Dates:
International Conference on Theory and Applications of Satisfiability Testing, 2005-06-01
Related URLs:
Organisations:
Electronics & Computer Science
Identifiers
Local EPrints ID: 261996
URI: http://eprints.soton.ac.uk/id/eprint/261996
PURE UUID: 9ff361ab-3e85-4a7b-99c8-e40bfb2db7c4
Catalogue record
Date deposited: 20 Feb 2006
Last modified: 14 Mar 2024 07:02
Export record
Contributors
Author:
M. N. Mneimneh
Author:
I. Lynce
Author:
Z. S. Andraus
Author:
J. P. Marques-Silva
Author:
K. A. Sakallah
Editor:
F. Bacchus
Editor:
T. Walsh
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.