DocumentCode
2995340
Title
Evolutionary search in inductive equational logic programming
Author
Hamel, Lutz H.
Author_Institution
Dept. of Comput. Sci. & Stat., Rhode Island Univ., Kingston, RI, USA
Volume
4
fYear
2003
fDate
8-12 Dec. 2003
Firstpage
2426
Abstract
Concept learning is the induction of a description from a set of examples. Inductive logic programming can be considered a special case of the general notion of concept learning specifically referring to the induction of first-order theories. Both concept learning and inductive logic programming can be seen as a search over all possible sentences in some representation language for sentences that correctly explain the examples and also generalize to other sentences that are part of that concept. We explore inductive logic programming with equational logic as the representation language. We present a high-level overview of the implementation of inductive equational logic using genetic programming and discuss encouraging results based on experiments that are intended to emulate real world scenarios.
Keywords
formal logic; genetic algorithms; inductive logic programming; learning by example; programming language semantics; search problems; concept learning; evolutionary search; first-order theory; genetic programming; inductive equational logic programming; programming language semantics; representation language; Algebra; Computer languages; Computer science; Equations; Genetic programming; Logic functions; Logic programming; Robustness; Software testing; Statistics;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2003. CEC '03. The 2003 Congress on
Print_ISBN
0-7803-7804-0
Type
conf
DOI
10.1109/CEC.2003.1299392
Filename
1299392
Link To Document