default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaolo Marin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[p2]Enrico Giunchiglia
, Paolo Marin, Massimo Narizzano:
Reasoning with Quantified Boolean Formulas. Handbook of Satisfiability 2021: 1157-1176
2010 – 2019
- 2017
- [c10]Ralf Wimmer, Sven Reimer, Paolo Marin, Bernd Becker:
HQSpre - An Effective Preprocessor for QBF and DQBF. TACAS (1) 2017: 373-390 - 2016
- [j5]Paolo Marin, Massimo Narizzano, Luca Pulina, Armando Tacchella, Enrico Giunchiglia:
Twelve Years of QBF Evaluations: QSAT Is PSPACE-Hard and It Shows. Fundam. Informaticae 149(1-2): 133-158 (2016) - 2015
- [j4]Christian Miller, Paolo Marin, Bernd Becker:
Verification of partial designs using incremental QBF. AI Commun. 28(2): 283-307 (2015) - [c9]Paolo Marin, Massimo Narizzano, Luca Pulina, Armando Tacchella, Enrico Giunchiglia:
An Empirical Perspective on Ten Years of QBF Solving. RCRA@AI*IA 2015: 62-75 - 2014
- [j3]Sven Reimer, Matthias Sauer, Paolo Marin, Bernd Becker:
QBF with Soft Variables. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 70 (2014) - 2012
- [c8]Bernd Becker, Rüdiger Ehlers, Matthew Lewis, Paolo Marin:
ALLQBF Solving by Computational Learning. ATVA 2012: 370-384 - [c7]Paolo Marin, Christian Miller, Matthew Lewis, Bernd Becker:
Verification of partial designs using incremental QBF solving. DATE 2012: 623-628 - [c6]Paolo Marin, Christian Miller, Bernd Becker:
Incremental QBF Preprocessing for Partial Design Verification - (Poster Presentation). SAT 2012: 473-474 - 2011
- [j2]Matthew Lewis, Tobias Schubert, Bernd Becker, Paolo Marin, Massimo Narizzano, Enrico Giunchiglia:
Parallel QBF Solving with Advanced Knowledge Sharing. Fundam. Informaticae 107(2-3): 139-166 (2011) - 2010
- [j1]Enrico Giunchiglia, Paolo Marin, Massimo Narizzano:
QuBE7.0. J. Satisf. Boolean Model. Comput. 7(2-3): 83-88 (2010) - [c5]Enrico Giunchiglia, Paolo Marin, Massimo Narizzano:
sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning. SAT 2010: 85-98
2000 – 2009
- 2009
- [c4]Paolo Marin, Matthew Lewis, Tobias Schubert, Massimo Narizzano, Bernd Becker, Enrico Giunchiglia:
Evaluation of Knowledge Sharing Strategies in a Parallel QBF Solver. RCRA@AI*IA 2009 - [c3]Paolo Marin, Massimo Narizzano, Enrico Giunchiglia, Matthew Lewis, Tobias Schubert, Bernd Becker:
Comparison of knowledge sharing strategies in a parallel QBF solver. HPCS 2009: 161-167 - [c2]Matthew Lewis, Paolo Marin, Tobias Schubert, Massimo Narizzano, Bernd Becker, Enrico Giunchiglia:
PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing. SAT 2009: 509-523 - [p1]Enrico Giunchiglia, Paolo Marin, Massimo Narizzano:
Reasoning with Quantified Boolean Formulas. Handbook of Satisfiability 2009: 761-780 - 2008
- [c1]Enrico Giunchiglia, Paolo Marin, Massimo Narizzano:
Preprocessing Techniques for QBFs. RCRA 2008
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
