05494356

a

05494356 Sierra, Josefina Santib\'a\~nez, Josefina Horn query learning with multiple refinement. Li, Xiaodong (ed.) et al., Simulated evolution and learning. 7th international conference, SEAL 2008, Melbourne, Australia, December 7--10, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-89693-7/pbk). Lecture Notes in Computer Science 5361, 503-513 (2008). 2008 Berlin: Springer EN

doi:10.1007/978-3-540-89694-4_51

Summary: In this paper we try to understand the heuristics that underlie the decisions made by the Horn query learning algorithm proposed in [1]. We take advantage of our explicit representation of such heuristics in order to present an alternative termination proof for the algorithm, as well as to justify its decisions by showing that they always guarantee that the negative examples in the sequence maintained by the algorithm violate different clauses in the target formula. Finally, we propose a new algorithm that allows multiple refinement when we can prove that such a refinement does not affect the independence of the negative examples in the sequence maintained by the algorithm.