Toggle navigation
Publications
Researchers
Institutions
0
Sign In
Federated Authentication
(Click on the image)
Local Sign In
Password Recovery
Register
Sign In
Publications
Search
Statistics
A Branch and Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Subformulas
AuthID
P-003-DTF
6
Author(s)
Liffiton, M
·
Mneimneh, M
·
Lynce, I
·
Andraus, Z
·
Marques Silva, J
·
Sakallah, K
Document Type
Article
Year published
2009
Published
in
CONSTRAINTS,
ISSN: 1383-7133
Volume: 14, Issue: 4, Pages: 415-442 (28)
Indexing
Wos
®
Scopus
®
Dblp
®
/en/publications/view/112463
Crossref
®
Unpaywall
®
Google Scholar
®
Metadata
Sources
Publication Identifiers
DOI
:
10.1007/s10601-008-9058-8
DBLP
: journals/constraints/LiffitonMLAMS09
SCOPUS
: 2-s2.0-70349507165
Unpaywall
: 10.1007/s10601-008-9058-8
Wos
: WOS:000270439000001
Source Identifiers
ISSN
: 1383-7133
Export Publication Metadata
Export
×
Publication Export Settings
BibTex
EndNote
APA
Export Preview
Marked List
Add to Marked List
Info
At this moment we don't have any links to full text documens.
×
Select Source
This publication has:
2 records from
ISI
2 records from
SCOPUS
2 records from
DBLP
2 records from
Unpaywall
2 records from
Openlibrary
2 records from
Handle
Please select which records must be used by Authenticus!
×
Preview Publications
© 2024 CRACS & Inesc TEC - All Rights Reserved
Privacy Policy
|
Terms of Service