Abstraction-Based Algorithm for 2Qbf

AuthID
 P-007-YTA
2
Author(s)
2
Editor(es)
Sakallah,KA;Simon,L
Tipo de Documento
Proceedings Paper
Year published
2011
Publicado
in THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2011 in Lecture Notes in Computer Science, ISSN: 0302-9743
Volume: 6695, Páginas: 230-244 (15)
Conference
14Th International Conference on Theory and Applications of Satisfiability Testing (Sat), Date: JUN 19-22, 2011, Location: Univ Michigan, Dept Elect Engn & Comp Sci, Comp Sci & Engn Div, Ann Arbor, MI, Patrocinadores: Microsoft Res, Microsoft Res INRIA Joint Ctr, Univ Orsay Paris Sud 11, Host: Univ Michigan, Dept Elect Engn & Comp Sci, Comp Sci & Engn Div
Indexing
Wos®
Scopus®
Dblp®
Crossref®
Unpaywall®
Google Scholar®
Publication Identifiers
DBLP: conf/sat/JanotaS11
SCOPUS: 2-s2.0-79959384363
Unpaywall: 10.1007/978-3-642-21581-0_19
Wos: WOS:000392158300019
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