default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUwe Bubeck
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[p2]Hans Kleine Büning, Uwe Bubeck:
Theory of Quantified Boolean Formulas. Handbook of Satisfiability 2021: 1131-1156
2010 – 2019
- 2015
- [j4]Uwe Bubeck, Hans Kleine Büning:
Learning Boolean specifications. Artif. Intell. 229: 246-257 (2015) - 2013
- [c8]Uwe Bubeck, Hans Kleine Büning:
Nested Boolean Functions as Models for Quantified Boolean Formulas. SAT 2013: 267-275 - 2012
- [j3]Uwe Bubeck, Hans Kleine Büning:
Encoding Nested Boolean Functions as Quantified Boolean Formulas. J. Satisf. Boolean Model. Comput. 8(1/2): 101-116 (2012) - 2011
- [c7]Hans Kleine Büning, Xishun Zhao, Uwe Bubeck:
Transformations into Normal Forms for Quantified Circuits. SAT 2011: 245-258 - 2010
- [b1]Uwe Bubeck:
Model-based transformations for quantified boolean formulas. University of Paderborn, DISKI 329, IOS Press 2010, ISBN 978-3-89838-329-5, pp. 1-211 - [c6]Uwe Bubeck, Hans Kleine Büning:
Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN. SAT 2010: 58-70 - [c5]Claudia Peschiera, Luca Pulina
, Armando Tacchella, Uwe Bubeck, Oliver Kullmann, Inês Lynce:
The Seventh QBF Solvers Evaluation (QBFEVAL'10). SAT 2010: 237-250
2000 – 2009
- 2009
- [j2]Uwe Bubeck, Hans Kleine Büning:
A new 3-CNF transformation by parallel-serial graphs. Inf. Process. Lett. 109(7): 376-379 (2009) - [c4]Hans Kleine Büning, Xishun Zhao, Uwe Bubeck:
Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits. SAT 2009: 391-397 - [p1]Hans Kleine Büning, Uwe Bubeck:
Theory of Quantified Boolean Formulas. Handbook of Satisfiability 2009: 735-760 - 2008
- [j1]Uwe Bubeck, Hans Kleine Büning:
Models and quantifier elimination for quantified Horn formulas. Discret. Appl. Math. 156(10): 1606-1622 (2008) - 2007
- [c3]Uwe Bubeck, Hans Kleine Büning:
Bounded Universal Expansion for Preprocessing QBF. SAT 2007: 244-257 - 2006
- [c2]Uwe Bubeck, Hans Kleine Büning:
Dependency Quantified Horn Formulas: Models and Complexity. SAT 2006: 198-211 - 2005
- [c1]Uwe Bubeck, Hans Kleine Büning, Xishun Zhao:
Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas. SAT 2005: 386-392
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 22:49 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:
