default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrank J. Oles
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[j10]Frank J. Oles:
On being a student of John Reynolds. Theor. Comput. Sci. 375(1-3): 346-350 (2007)- 2005
- [j9]Frank J. Oles:
Precedence-inclusion patterns and relational learning. Theor. Comput. Sci. 342(2-3): 262-315 (2005) - 2002
- [j8]David E. Johnson, Frank J. Oles, Tong Zhang, Thilo Götz:
A decision-tree-based symbolic rule induction system for text categorization. IBM Syst. J. 41(3): 428-437 (2002) - 2001
- [j7]Tong Zhang, Frank J. Oles:
Text Categorization Based on Regularized Linear Classification Methods. Inf. Retr. 4(1): 5-31 (2001) - 2000
- [j6]Frank J. Oles:
An application of lattice theory to knowledge representation. Theor. Comput. Sci. 249(1): 163-196 (2000)
1990 – 1999
- 1999
- [j5]Sholom M. Weiss, Chidanand Apté, Fred J. Damerau, David E. Johnson, Frank J. Oles, Thilo Götz, Thomas Hampp:
Maximizing text-mining performance. IEEE Intell. Syst. 14(4): 63-69 (1999) - 1996
- [c8]Frank J. Oles, Eric Mays, Robert A. Weida:
The Algebraic Essence of K-Rep. Description Logics 1996: 182-184 - [c7]Robert A. Weida, Eric Mays, Robert Dionne, Meir Laker, Brian White, Chihong Liang, Frank J. Oles:
The K-Rep System Architecture. Description Logics 1996: 197-199 - 1995
- [j4]Michael W. Mislove
, Frank J. Oles:
Adjunctions Between Categories of Domains. Fundam. Informaticae 22(1/2): 93-116 (1995) - [j3]Michael W. Mislove, Frank J. Oles:
Full Abstraction and Recursion. Theor. Comput. Sci. 151(1): 207-256 (1995) - 1993
- [c6]Robert Dionne, Eric Mays, Frank J. Oles:
The Equivalence of Model-Theoretic and Structural Subsumption in Description Logics. IJCAI 1993: 710-717 - 1992
- [j2]Frank J. Oles:
When is a Category of Many-Sorted Algebras Cartesian Closed? Int. J. Found. Comput. Sci. 3(2): 225-231 (1992) - [c5]Robert Dionne, Eric Mays, Frank J. Oles:
A Non-Well-Founded Approach to Terminological Cycles. AAAI 1992: 761-766 - [c4]Michael W. Mislove, Frank J. Oles:
Full Abstraction and Unnested Recursion. REX Workshop 1992: 384-397 - 1991
- [j1]Michael W. Mislove, Lawrence S. Moss, Frank J. Oles:
Non-Well-Founded Sets Modeled as Ideal Fixed Points. Inf. Comput. 93(1): 16-54 (1991) - [c3]Michael W. Mislove, Frank J. Oles:
A Simple Language Supporting Angelic Nondeterminism and Parallel Composition. MFPS 1991: 77-101
1980 – 1989
- 1989
- [c2]Michael W. Mislove, Lawrence S. Moss, Frank J. Oles:
Non-Well-Founded Sets Obtained from Ideal Fixed Points. LICS 1989: 263-272 - 1987
- [c1]Frank J. Oles:
Semantics for Concurrency without Powerdomains. POPL 1987: 211-222
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 2025-01-09 13:16 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:
