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

AuthID
 P-000-6V2
5
Author(s)
Mneimneh, M
·
Andraus, Z
·
Sakallah, K
2
Editor(s)
Bacchus,F;Walsh,T
Document Type
Proceedings Paper
Year published
2005
Published
in THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, PROCEEDINGS in Lecture Notes in Computer Science, ISSN: 0302-9743
Volume: 3569, Pages: 467-474 (8)
Conference
8Th International Conference on Theory and Applications of Satisfiability Testing, Date: JUN 19-23, 2005, Location: St Andrews, SCOTLAND, Sponsors: Cadence Design Syst, Intel Corp, Intelligence Informat Syst Inst, Microsoft Res, CoLogNet Network Excellence
Indexing
Wos®
Scopus®
Dblp®/en/publications/view/7010
Google Scholar®
Publication Identifiers
DBLP: conf/sat/MneimnehLASS05
SCOPUS: 2-s2.0-26444609633
Wos: WOS:000230386900040
Source Identifiers
ISSN: 0302-9743
Export Publication Metadata
Marked List
 Add to Marked List
Info
At this moment we don't have any links to full text documens.

A place for researchers and their institutions

Useful Links

Get Help

© 2024 CRACS & Inesc TEC - All Rights Reserved Privacy Policy | Terms of Service