default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas A. Sudkamp
Person information
- affiliation: Wright State University, Department of Computer Science, Fairborn, OH, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j21]Moon G. Joo, Thomas A. Sudkamp:
A Method of Converting a Fuzzy System to a Two-Layered Hierarchical Fuzzy System and Its Run-Time Efficiency. IEEE Trans. Fuzzy Syst. 17(1): 93-103 (2009)- 2008
- [j20]Ildar Z. Batyrshin, Thomas A. Sudkamp:
Perception based data mining and decision support systems. Int. J. Approx. Reason. 48(1): 1-3 (2008) - [j19]Thomas A. Sudkamp:
Refinement of temporal constraints in fuzzy associations. Int. J. Approx. Reason. 48(1): 23-35 (2008) - [j18]Thomas A. Sudkamp:
Sporadic fuzzy temporal associations. Int. J. Gen. Syst. 37(1): 3-16 (2008) - 2007
- [j17]Mathieu Serrurier, Didier Dubois, Henri Prade, Thomas A. Sudkamp:
Learning fuzzy rules with their implication operators. Data Knowl. Eng. 60(1): 71-89 (2007) - 2005
- [j16]Thomas A. Sudkamp:
Examples, counterexamples, and measuring fuzzy associations. Fuzzy Sets Syst. 149(1): 57-71 (2005) - [j15]Didier Dubois, Henri Prade, Thomas A. Sudkamp:
On the representation, measurement, and discovery of fuzzy associations. IEEE Trans. Fuzzy Syst. 13(2): 250-262 (2005) - [c11]Mathieu Serrurier, Thomas A. Sudkamp, Didier Dubois, Henri Prade:
Fuzzy Inductive Logic Programming: Learning Fuzzy Rules with their Implication. FUZZ-IEEE 2005: 613-618 - 2003
- [j14]Daniel S. Spiegel, Thomas A. Sudkamp:
Sparse data in the evolutionary generation of fuzzy models. Fuzzy Sets Syst. 138(2): 363-379 (2003) - [j13]Thomas A. Sudkamp, Aaron Knapp, Jon Knapp:
Model generation by domain refinement and rule reduction. IEEE Trans. Syst. Man Cybern. Part B 33(1): 45-55 (2003) - [c10]Didier Dubois, Henri Prade, Thomas A. Sudkamp:
A Discussion of Indices for the Evaluation of Fuzzy Associations in Relational Databases. IFSA 2003: 111-118 - 2002
- [j12]Daniel S. Spiegel, Thomas A. Sudkamp:
Employing locality in the evolutionary generation of fuzzy rule bases. IEEE Trans. Syst. Man Cybern. Part B 32(3): 296-305 (2002) - 2000
- [c9]Thomas A. Sudkamp:
Similarity as a foundation for possibility. FUZZ-IEEE 2000: 735-740 - [c8]Thomas A. Sudkamp, Aaron Knapp, Jon Knapp:
A greedy approach to rule reduction in fuzzy models. SMC 2000: 3716-3721
1990 – 1999
- 1998
- [j11]Thomas A. Sudkamp, Robert J. Hammell II:
Scalability in Fuzzy Rule-Based Learning. Inf. Sci. 109(1-4): 135-147 (1998) - [c7]Thomas A. Sudkamp, Daniel S. Spiegel:
Generation of fuzzy models via evolutionary strategies. SMC 1998: 1934-1939 - 1997
- [c6]Robert J. Hammell, Thomas A. Sudkamp:
A Fuzzy Model for Learning and Adaptivity. ICTAI 1997: 540-547 - 1996
- [j10]Valerie Cross, Thomas A. Sudkamp:
Geometric compatibility modification. Fuzzy Sets Syst. 84(3): 283-299 (1996) - 1995
- [j9]Robert J. Hammell II, Thomas A. Sudkamp:
A Two-Level Architecture for Fuzzy Learning. J. Intell. Fuzzy Syst. 3(4): 273-286 (1995) - 1994
- [j8]Valerie V. Cross, Thomas A. Sudkamp:
Patterns of fuzzy rule-based inference. Int. J. Approx. Reason. 11(3): 235-255 (1994) - [j7]Thomas A. Sudkamp, Robert J. Hammell II:
Interpolation, Completion, and Learning Fuzzy Rules. IEEE Trans. Syst. Man Cybern. Syst. 24(2): 332-342 (1994) - 1992
- [j6]Thomas A. Sudkamp:
The consistency of Dempster-Shafer updating. Int. J. Approx. Reason. 7(1-2): 19-44 (1992) - [j5]Chris Fickert, Thomas A. Sudkamp:
Unification based FP interpreters. ACM SIGPLAN Notices 27(11): 49-58 (1992)
1980 – 1989
- 1988
- [b1]Thomas A. Sudkamp:
Languages and machines - an introduction to the theory of computer science. Addison-Wesley series in computer science, Addison-Wesley 1988, ISBN 978-0-201-15768-0, pp. I-XV, 1-441 - 1987
- [c5]Thomas A. Sudkamp, Robert Shanahan:
Analysis of heurisitc search models. ACM Conference on Computer Science 1987: 7-15 - [c4]Thomas A. Sudkamp:
Domain Independent Support Propagation Architectures. ISMIS 1987: 131-138 - 1986
- [c3]Thomas A. Sudkamp:
Grammars for functional languages. ACM Conference on Computer Science 1986: 155-164 - [c2]Thomas A. Sudkamp:
Inference propagation in emitter, system hierarchies. ISMIS 1986: 165-173 - 1984
- [c1]Henry W. Davis, Randy B. Pollack, Thomas A. Sudkamp:
Towards a Better Understanding of Bidirectional Search. AAAI 1984: 68-72
1970 – 1979
- 1979
- [j4]Thomas A. Sudkamp:
On full cylindric set algebras. Notre Dame J. Formal Log. 20(4): 785-793 (1979) - 1978
- [j3]Thomas A. Sudkamp:
Self-conjugate functions on Boolean algebras. Notre Dame J. Formal Log. 19(3): 504-512 (1978) - [j2]Thomas A. Sudkamp:
An additional remark on self-conjugate functions of Boolean algebras. Notre Dame J. Formal Log. 19(4): 637-638 (1978) - 1976
- [j1]Thomas A. Sudkamp:
A proof of Sobociński's conjecture concerning a certain set of lattice-theoretical formulas. Notre Dame J. Formal Log. 17(4): 615-616 (1976)
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-25 05:47 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:
