default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKarsten Schölzel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j8]Miguel Couceiro, Lucien Haddad, Karsten Schölzel:
On the Lower Part of the Lattice of Partial Clones. J. Multiple Valued Log. Soft Comput. 33(3): 177-196 (2019)- 2017
- [j7]Miguel Couceiro, Lucien Haddad, Karsten Schölzel, Tamás Waldhauser:
A Solution to a Problem of D. Lau: Complete Classification of Intervals in the Lattice of Partial Boolean Clones. J. Multiple Valued Log. Soft Comput. 28(1): 47-58 (2017) - [c13]Miguel Couceiro
, Lucien Haddad, Karsten Schölzel:
On the Nonexistence of Minimal Strong Partial Clones. ISMVL 2017: 82-87 - [c12]Lucien Haddad, Karsten Schölzel:
A Note on Intervals of Słupecki Partial Clones. ISMVL 2017: 94-99 - 2015
- [j6]Miguel Couceiro, Erkko Lehtonen, Karsten Schölzel:
Set-reconstructibility of Post classes. Discret. Appl. Math. 187: 12-18 (2015) - [j5]Miguel Couceiro, Erkko Lehtonen, Karsten Schölzel:
Hypomorphic Sperner Systems and Non-Reconstructible Functions. Order 32(2): 255-292 (2015) - [j4]Miguel Couceiro, Erkko Lehtonen, Karsten Schölzel:
A complete classification of equational classes of threshold functions included in clones. RAIRO Oper. Res. 49(1): 39-66 (2015) - [c11]Miguel Couceiro, Lucien Haddad, Maurice Pouzet, Karsten Schölzel:
Hereditarily Rigid Relations: Dedicated to Professor I.G. Rosenberg on the Occasion of His 80-th Birthday. ISMVL 2015: 84-89 - 2014
- [c10]Boris A. Romov, Karsten Schölzel:
Partial R-Clones. ISMVL 2014: 91-96 - [c9]Lucien Haddad, Karsten Schölzel:
Countable Intervals of Partial Clones. ISMVL 2014: 155-160 - [c8]Miguel Couceiro, Lucien Haddad, Karsten Schölzel, Tamás Waldhauser:
Relation Graphs and Partial Clones on a 2-Element Set. ISMVL 2014: 161-166 - 2013
- [c7]Miguel Couceiro, Lucien Haddad, Karsten Schölzel, Tamás Waldhauser:
A Solution to a Problem of D. Lau: Complete Classification of Intervals in the Lattice of Partial Boolean Clones. ISMVL 2013: 123-128 - [c6]Lucien Haddad, Karsten Schölzel:
Intersections with Slupecki Partial Clones on a Finite Set. ISMVL 2013: 135-140 - 2012
- [j3]Matthias Böhm, Karsten Schölzel:
A generalization of Completely Separating Systems. Discret. Math. 312(22): 3213-3227 (2012) - [j2]Karsten Schölzel:
Counting the Maximal Partial Clones on a Finite Set. J. Multiple Valued Log. Soft Comput. 18(2): 153-165 (2012) - [j1]Karsten Schölzel:
A Sheffer-Criterion for Partial 4-Valued Logic. J. Multiple Valued Log. Soft Comput. 18(2): 167-199 (2012) - 2011
- [c5]Karsten Schölzel:
Galois Theory for Partial Clones and Some Relational Clones. ISMVL 2011: 187-192 - 2010
- [c4]Dietlinde Lau, Karsten Schölzel:
A Classification of Partial Boolean Clones. ISMVL 2010: 189-194 - [c3]Karsten Schölzel:
Number of Maximal Partial Clones. ISMVL 2010: 288-293
2000 – 2009
- 2009
- [c2]Karsten Schölzel:
Minimal Coverings of Maximal Partial Clones. ISMVL 2009: 114-119 - [c1]Karsten Schölzel:
The Minimal Covering of Maximal Partial Clones in 4-valued Logic. ISMVL 2009: 126-131
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:51 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:
