default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClint J. van Alten
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j23]Dmitry Shkatov
, Clint J. van Alten:
Complexity of the Universal Theory of Residuated Ordered Groupoids. J. Log. Lang. Inf. 32(3): 489-510 (2023)- [j22]Branden Ingram, Clint J. van Alten, Richard Klein, Benjamin Rosman:
Generating Interpretable Play-Style Descriptions Through Deep Unsupervised Clustering of Trajectories. IEEE Trans. Games 15(4): 507-516 (2023) - [c5]Branden Ingram, Clint J. van Alten, Richard Klein, Benjamin Rosman:
Creating Diverse Play-Style-Centric Agents through Behavioural Cloning. AIIDE 2023: 255-265 - [i3]Clint J. van Alten:
Highly connected dynamic artificial neural networks. CoRR abs/2302.08928 (2023) - 2022
- [c4]Branden Ingram, Benjamin Rosman, Clint J. van Alten, Richard Klein:
Play-style Identification through Deep Unsupervised Clustering of Trajectories. CoG 2022: 393-400 - [c3]Branden Ingram, Benjamin Rosman, Clint J. van Alten, Richard Klein:
Improved Action Prediction through Multiple Model Processing of Player Trajectories. CoG 2022: 548-551 - [c2]Gift Khangamwa, Terence L. van Zyl, Clint J. van Alten:
Towards a Methodology for Addressing Missingness in Datasets, with an Application to Demographic Health Datasets. SACAIR 2022: 169-186 - [i2]Gift Khangamwa, Terence L. van Zyl, Clint J. van Alten:
Towards a methodology for addressing missingness in datasets, with an application to demographic health datasets. CoRR abs/2211.02856 (2022) - 2021
- [j21]Dmitry Shkatov, Clint J. van Alten:
Computational complexity for bounded distributive lattices with negation. Ann. Pure Appl. Log. 172(7): 102962 (2021) - [j20]Dmitry Shkatov, Clint J. van Alten:
Correction to: Complexity of the Universal Theory of Modal Algebras. Stud Logica 109(5): 1175 (2021) - 2020
- [j19]Dmitry Shkatov, Clint J. van Alten:
Complexity of the Universal Theory of Modal Algebras. Stud Logica 108(2): 221-237 (2020)
2010 – 2019
- 2019
- [i1]Dmitry Shkatov, Clint J. van Alten:
Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids. CoRR abs/1910.05556 (2019) - 2018
- [j18]Wilmari Morton, Clint J. van Alten:
Distributive and completely distributive lattice extensions of ordered sets. Int. J. Algebra Comput. 28(3): 521-541 (2018) - 2017
- [j17]Wilmari Morton, Clint J. van Alten:
The canonical FEP construction. J. Log. Comput. 27(3): 609-637 (2017) - 2016
- [j16]Ivo Düntsch, Ewa Orlowska, Clint J. van Alten:
Discrete dualities for n-potent MTL-algebras and 2-potent BL-algebras. Fuzzy Sets Syst. 292: 203-214 (2016) - [j15]Clint J. van Alten:
Embedding Ordered Sets into Distributive Lattices. Order 33(3): 419-427 (2016) - 2013
- [j14]Wilmari Morton, Clint J. van Alten:
Modal MTL-algebras. Fuzzy Sets Syst. 222: 58-77 (2013) - [j13]Willem Conradie, Wilmari Morton, Clint J. van Alten:
An algebraic look at filtrations in modal logic. Log. J. IGPL 21(5): 788-811 (2013) - [j12]Clint J. van Alten:
Prelinear Algebras in Relatively Regular Quasivarieties. Order 30(2): 573-583 (2013) - [j11]Clint J. van Alten:
Partial algebras and complexity of satisfiability and universal theory for distributive lattices, boolean algebras and Heyting algebras. Theor. Comput. Sci. 501: 82-92 (2013) - 2011
- [j10]Clint J. van Alten:
Preservation theorems for MTL-chains. Log. J. IGPL 19(3): 490-511 (2011)
2000 – 2009
- 2008
- [j9]Jeffrey S. Olson, James G. Raftery, Clint J. van Alten:
Structural Completeness in Substructural Logics. Log. J. IGPL 16(5): 453-495 (2008) - 2006
- [j8]Clint J. van Alten:
On Varieties of Biresiduation Algebras. Stud Logica 83(1-3): 425-445 (2006) - [c1]Wojciech Dzik, Ewa Orlowska, Clint J. van Alten:
Relational Representation Theorems for General Lattices with Negations. RelMiCS 2006: 162-176 - [p1]Wojciech Dzik, Ewa Orlowska, Clint J. van Alten:
Relational Representation Theorems for Lattices with Negations: A Survey. Theory and Applications of Relational Structures as Knowledge Instruments 2006: 245-266 - 2005
- [j7]Clint J. van Alten:
The finite model property for knotted extensions of propositional linear logic. J. Symb. Log. 70(1): 84-98 (2005) - [j6]James G. Raftery, Clint J. van Alten:
Corrigendum: Residuation in Commutative Ordered Monoids with Minimal Zero. Reports Math. Log. 39: 133-135 (2005) - 2004
- [j5]Clint J. van Alten, James G. Raftery:
Rule Separation and Embedding Theorems for Logics Without Weakening. Stud Logica 76(2): 241-274 (2004) - 2000
- [j4]James G. Raftery, Clint J. van Alten:
Residuation in Commutative Ordered Monoids with Minimal Zero. Reports Math. Log. 34: 23-57 (2000) - [j3]Willem J. Blok, Clint J. van Alten:
On the Finite Embeddability Property for Residuated Lattices, Pocrims and BCK-algebras. Reports Math. Log. 34: 159-165 (2000)
1990 – 1999
- 1999
- [j2]Clint J. van Alten, James G. Raftery:
The Finite Model Property for the Implicational Fragment of IPC Without Exchange and Contraction. Stud Logica 63(2): 213-222 (1999) - 1997
- [j1]Clint J. van Alten, James G. Raftery:
On Quasivariety Semantics of Fragments of Intuitionistic Propositional Logic without Exchange and Contraction Rules. Reports Math. Log. 31: 3-55 (1997)
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-11-07 20:30 CET 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:
