PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Query learning of Horn formulas revisited: progress and open questions
José Balcázar
In: Computability in Europe, 8-12 June 2005, Amsterdam, The Netherlands.


We discuss a number of (mostly open) questions related to the learnability of Horn clauses from queries. We consider that the currently existing solution is satisfactory only to a certain extent, and that progress on the related questions stated here could contribute positively to advancing the state of the art in several related fields. Our contributions here are a new analysis of the existing algorithm, a new algorithm based on novel ideas, and the complete proof of a related structural result.

Postscript - Requires a viewer, such as GhostView
EPrint Type:Conference or Workshop Item (Paper)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:1595
Deposited By:José Balcázar
Deposited On:28 November 2005