Title: Department of Computer Science Seminar
Date: Wed, Nov. 29, 2000
Time: 10:00 am to 11:am
Venue: Room N101, CSIT Building [108]
Speaker: Dr Eric C McCreath (Basser Department of Computer Science, University of Sydney )
Description: "Lime: A System for Learning Relations"


                        Abstract


This seminar briefly describes the design of the inductive logic
programming system Lime.  Instead of employing a greedy covering
approach to constructing clauses, Lime employs a Bayesian heuristic
to evaluate logic programs as hypotheses. The notion of a simple
clause is introduced.  These sets of literals may be viewed as subparts
of clauses that are effectively independent in terms of variables
used. Instead of growing a  clause one literal at a time, 
Lime efficiently combines simple clauses to construct 
a set of gainful candidate clauses. Subsets of these candidate clauses
are evaluated via the Bayesian heuristic to find the final
hypothesis. Details of the algorithms and data structures of Lime 
are discussed. Lime's handling of recursive logic programs is also described.

URL: http://cs.anu.edu.au/lib/seminars/seminars00/dept20001129a