Learning Inequated Range Restricted Horn Expressions
Marta Arias, Roni Khardon · ERA · 2000
. A learning algorithm for the class of inequated range restricted Horn expressions is presented and proved correct. The main property of this class is that all the terms in the conclusion of a clause appear in the antecedent of the clause, possibly as subterms of more complex terms. And every clause includes in its antecedent all inequalities possible between all terms appearing in it. The algorithm works within the framework of learning from entailment, where the goal is to exactly identify some pre-fixed and unknown expression by making questions to membership and equivalence oracles. 1 Introduction This paper considers the problem of learning an unknown first order expression 1 T from examples of clauses that T entails or does not entail. This type of learning framework is known as learning from entailment. A great deal of work has been done in this learning setting. For example, [FP93] formalised learning from entailment using equivalence queries and membership queries in the s...