
[ ILPnet2 | Library | Newsletter | CSCW | Education | End-User Club | Events | Nodes | Systems | Applications | Members only ]
Logical characterisations of inductive learning
Peter A. Flach.
In Dov M. Gabbay
and Rudolf Kruse, editors, Handbook of defeasible
reasoning and uncertainty management systems, Vol. 4: Abductive reasoning and
learning, pages 155--196. Kluwer Academic Publishers, October 2000.
Abstract
This chapter presents a logical analysis of induction. Contrary to common
approaches to inductive logic that treat inductive validity as a real-valued
generalisation of deductive validity, we argue that the only logical step in
induction lies in hypothesis \em generation rather than evaluation.
Inspired by the seminal paper of Kraus, Lehmann and Magidor we analyse the
logic of inductive hypothesis generation on the meta-level of consequence
relations. Two main forms of induction are considered: explanatory induction,
aimed at inducing a general theory explaining given observations, and
confirmatory induction, aimed at characterising completely or partly observed
models. Several sets of meta-theoretical properties of inductive consequence
relations are considered, each of them characterised by a suitable semantics.
The approach followed in this chapter is extensively motivated by referring
to recent and older work in philosophy, logic, and machine learning.
BibTeX entry.
Other publications
P A Flach,
Peter.Flach@bristol.ac.uk. Last modified on Wednesday 9 April 2003 at 18:31. © 2003 ILPnet2