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(es)
Bacchus,F;Walsh,T
Tipo de Documento
Proceedings Paper
Year published
2005
Publicado
in THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, PROCEEDINGS in Lecture Notes in Computer Science, ISSN: 0302-9743
Volume: 3569, Páginas: 467-474 (8)
Conference
8Th International Conference on Theory and Applications of Satisfiability Testing, Date: JUN 19-23, 2005, Location: St Andrews, SCOTLAND, Patrocinadores: Cadence Design Syst, Intel Corp, Intelligence Informat Syst Inst, Microsoft Res, CoLogNet Network Excellence
Indexing
Wos®
Scopus®
Dblp®
Google Scholar®
Publication Identifiers
DBLP: conf/sat/MneimnehLASS05
SCOPUS: 2-s2.0-26444609633
Wos: WOS:000230386900040
Source Identifiers
ISSN: 0302-9743
Export Publication Metadata
Lista Marked
 Adicionar à lista Marked
Citações
Oops! It looks like you don't have access to this content.

This section is restricted to uses with b-on access.

CORE Conference
No information about CORE Rank

During the preprocessing phase, only publications of type 'Proceedings Paper' or 'Proceedings' are automatically processed to identify their CORE Rank.

TIP: If your publication's CORE Rank is missing, you can contact with your institutional manager to have the correct ranking manually added to the record.

Journal Factors
Oops! It looks like you don't have access to this content.

This section is restricted to uses with b-on access.

External Info
Info @ doi.org

Um espaço para investigadores e suas Instituições

Links Úteis

Ajuda

© 2026 CRACS & Inesc TEC - All Rights Reserved Política de Privacidade | Terms of Service