Matters Horn and other features in the computational learning theory landscape: The notion of membership
Frazier, Michael Duane
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/21745
Description
Title
Matters Horn and other features in the computational learning theory landscape: The notion of membership
Author(s)
Frazier, Michael Duane
Issue Date
1994
Doctoral Committee Chair(s)
Pitt, Leonard
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Computer Science
Language
eng
Abstract
Current knowledge representation research has sought to provide schemes for encoding knowledge about how a given system behaves, with the goal being accuracy and utility. Ideally, the goal of encoding knowledge is not the task of encoding, but the product of the encoding task. If such encodings are required for a variety of systems, then question of automating the process of encoding arises.
This thesis considers this automation process to be a question of whether it is possible to automatically learn the encoding based on the behavior of the system to be described. A variety of representation languages ${\cal L}$ are considered, as are a variety of means for the learner to acquire a variety of types of data about the system in question. The learning process is abstracted as a learning problem in which the goal is to collect efficiently sufficient information to identify some hidden concept C represented using the language ${\cal L}$. The source of information about C is its relationship to some class of examples ${\cal X}$ that is assumed to be reasonably available even though C itself is not. In addition to conjecturing guesses as to the identity of C, the learner is permitted ask how C relates to individuals $x \in {\cal X}$. The goal of inquiry about this automation process is either to produce a learning algorithm that efficiently automates the encoding of any representation that uses some useful representation language ${\cal L}$ or to show that no such learning algorithm is possible. The centerpiece of this thesis is that there do exist learning algorithms for two natural representation languages: propositional Horn sentences and the C scLASSIC description logic.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
