Frank J. Oles

According to our database, Frank J. Oles authored at least 18 papers between 1987 and 2007.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2007

On being a student of John Reynolds.

Frank J. Oles

Theor. Comput. Sci., 2007

2005

Precedence-inclusion patterns and relational learning.

Frank J. Oles

Theor. Comput. Sci., 2005

2002

A decision-tree-based symbolic rule induction system for text categorization.

David E. Johnson, Frank J. Oles, Tong Zhang, Thilo Götz

IBM Syst. J., 2002

2001

Text Categorization Based on Regularized Linear Classification Methods.

Tong Zhang, Frank J. Oles

Inf. Retr., 2001

2000

An application of lattice theory to knowledge representation.

Frank J. Oles

Theor. Comput. Sci., 2000

1999

Maximizing text-mining performance.

Sholom M. Weiss, Chidanand Apté, Fred J. Damerau, David E. Johnson, Frank J. Oles, Thilo Götz, Thomas Hampp

IEEE Intell. Syst., 1999

1996

The K-Rep System Architecture.

Robert A. Weida, Eric Mays, Robert Dionne, Meir Laker, Brian White, Chihong Liang, Frank J. Oles

Proceedings of the 1996 International Workshop on Description Logics, 1996

The Algebraic Essence of K-Rep.

Frank J. Oles, Eric Mays, Robert A. Weida

Proceedings of the 1996 International Workshop on Description Logics, 1996

1995

Full Abstraction and Recursion.

Michael W. Mislove, Frank J. Oles

Theor. Comput. Sci., 1995

Adjunctions Between Categories of Domains.

Michael W. Mislove, Frank J. Oles

Fundam. Informaticae, 1995

1993

The Equivalence of Model-Theoretic and Structural Subsumption in Description Logics.

Robert Dionne, Eric Mays, Frank J. Oles

Proceedings of the 13th International Joint Conference on Artificial Intelligence. Chambéry, France, August 28, 1993

1992

When is a Category of Many-Sorted Algebras Cartesian Closed?

Frank J. Oles

Int. J. Found. Comput. Sci., 1992

Full Abstraction and Unnested Recursion.

Michael W. Mislove, Frank J. Oles

Proceedings of the Sematics: Foundations and Applications, 1992

A Non-Well-Founded Approach to Terminological Cycles.

Robert Dionne, Eric Mays, Frank J. Oles

Proceedings of the 10th National Conference on Artificial Intelligence, 1992

1991

Non-Well-Founded Sets Modeled as Ideal Fixed Points

Michael W. Mislove, Lawrence S. Moss, Frank J. Oles

Inf. Comput., July, 1991

A Simple Language Supporting Angelic Nondeterminism and Parallel Composition.

Michael W. Mislove, Frank J. Oles

Proceedings of the Mathematical Foundations of Programming Semantics, 1991

1989

Non-Well-Founded Sets Obtained from Ideal Fixed Points

Michael W. Mislove, Lawrence S. Moss, Frank J. Oles

Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

1987

Semantics for Concurrency without Powerdomains.

Frank J. Oles

Proceedings of the Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, 1987