Rights accessRestricted access - publisher's policy
In this paper we try to understand the heuristics that underlie the decisions made by the Horn query learning algorithm proposed in . 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.
CitationSierra, J.; Santibáñez, J. Horn query learning with multiple refinement. "Lecture notes in computer science", 2008, vol. 5361, p. 503-513.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com