Campus Event Calendar
Event Entry
What and Who
Learning Non-Monotonic Logic Programs
Yannis Dimopoulos
MPII
Working Group Seminar
AG 1, AG 2, AG 3, INET, AG 4, AG 5, D6, RG1, SWS
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Wednesday, 24 April 96
10:45
60 Minutes
46.1 - MPII
023
Saarbrücken
Abstract
I will present an algorithm for learning nonmonotonic
logic programs, ie. logic programs that contain negative
literals in the body of the rules. The method is parametric
on a classical learning algorithm (one that learns definite
logic programs) whose generated rules are to be understood
as default rules. This means that these rules must be
tolerant to the negative examples by allowing for the
possibility of exceptions. The same classical algorithm
is then used, recursively, to learn these exceptions.
logic programs, ie. logic programs that contain negative
literals in the body of the rules. The method is parametric
on a classical learning algorithm (one that learns definite
logic programs) whose generated rules are to be understood
as default rules. This means that these rules must be
tolerant to the negative examples by allowing for the
possibility of exceptions. The same classical algorithm
is then used, recursively, to learn these exceptions.
Contact
--email hidden
passcode not visible
logged in users only