Information Services banner Edinburgh Research Archive The University of Edinburgh crest

Edinburgh Research Archive >
Informatics, School of >
Informatics Report Series >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1842/3402

View Statistics

Files in This Item:

File Description SizeFormat
0011.pdf376.03 kBAdobe PDFView/Open
Title: Learning Inequated Range Restricted Horn Expressions
Authors: Arias, Marta
Khardon, Roni
Issue Date: Mar-2000
Series/Report no.: Informatics Report Series
EDI-INF-RR-0011
Abstract: 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.
Keywords: Informatics
URI: http://hdl.handle.net/1842/3402
Appears in Collections:Informatics Report Series

Items in ERA are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! Unless explicitly stated otherwise, all material is copyright © The University of Edinburgh 2013, and/or the original authors. Privacy and Cookies Policy