default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKevin T. Kelly
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j11]Konstantin Genin, Kevin T. Kelly:
Theory Choice, Theory Change, and Inductive Truth-Conduciveness. Stud Logica 107(5): 949-989 (2019)- 2017
- [c7]Konstantin Genin, Kevin T. Kelly:
The Topology of Statistical Verifiability. TARK 2017: 236-250 - 2016
- [j10]Kevin T. Kelly, Konstantin Genin, Hanti Lin:
Realism, rhetoric, and reliability. Synth. 193(4): 1191-1223 (2016) - 2014
- [p3]Kevin T. Kelly:
A Computational Learning Semantics for Inductive Empirical Knowledge. Johan van Benthem on Logic and Information Dynamics 2014: 289-337 - 2012
- [j9]Hanti Lin, Kevin T. Kelly:
Propositional Reasoning that Tracks Probabilistic Reasoning. J. Philos. Log. 41(6): 957-981 (2012) - [j8]Hanti Lin, Kevin T. Kelly:
A geo-logical solution to the lottery paradox, with applications to conditional logic. Synth. 186(2): 531-575 (2012) - [i1]Kevin T. Kelly, Conor Mayo-Wilson:
Causal Conclusions that Flip Repeatedly and Their Justification. CoRR abs/1203.3488 (2012) - 2010
- [j7]Kevin T. Kelly, Conor Mayo-Wilson:
Ockham Efficiency Theorem for Stochastic Empirical Methods. J. Philos. Log. 39(6): 679-712 (2010) - [c6]Kevin T. Kelly, Conor Mayo-Wilson:
Causal Conclusions that Flip Repeatedly and Their Justification. UAI 2010: 277-285
2000 – 2009
- 2007
- [j6]Kevin T. Kelly:
Ockham's razor, empirical complexity, and truth-finding efficiency. Theor. Comput. Sci. 383(2-3): 270-289 (2007) - [p2]Kevin T. Kelly:
How Simplicity Helps You Find the Truth without Pointing at it. Induction, Algorithmic Learning Theory, and Philosophy 2007: 111-143 - [p1]Kevin T. Kelly:
How to Do Things with an Infinite Regress. Induction, Algorithmic Learning Theory, and Philosophy 2007: 199-217 - 2004
- [j5]Kevin T. Kelly:
Justification as Truth-Finding Efficiency: How Ockham's Razor Works. Minds Mach. 14(4): 485-505 (2004) - [j4]Kevin T. Kelly:
Uncomputability: the problem of induction internalized. Theor. Comput. Sci. 317(1-3): 227-249 (2004) - [c5]Keiko Pitter, Kevin T. Kelly, Michael Quiner:
BATTLE of the bandwidth. SIGUCCS 2004: 1-3 - 2002
- [c4]Kevin T. Kelly:
Efficient Convergence Implies Ockman's Razor. IC-AI 2002: 1220-1225
1990 – 1999
- 1998
- [c3]Kevin T. Kelly:
The Learning Power of Belief Revision. TARK 1998: 111-124 - 1993
- [j3]Kevin T. Kelly:
Learning Theory and Descriptive Set Theory. J. Log. Comput. 3(1): 27-45 (1993) - 1992
- [j2]Kevin T. Kelly, Clark Glymour:
Inductive inference from theory laden data. J. Philos. Log. 21(4): 391-444 (1992) - 1990
- [j1]Kevin T. Kelly, Clark Glymour:
Theory discovery from data with mixed quantifiers. J. Philos. Log. 19(1): 1-33 (1990)
1980 – 1989
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:55 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:
