CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
On Computing Minimum Unsatisfiable Cores
Authors
I. Lynce
J. P. Marques-Silva
Publication date
1 January 2003
Publisher
Abstract
Certifying the correctness of a SAT solver is straightforward for satisfiable instances of SAT. Given
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Southampton (e-Prints Soton)
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:eprints.soton.ac.uk:262252
Last time updated on 05/04/2012
