Show simple item record

dc.contributor.authorArias, Marta
dc.contributor.authorKhardon, Roni
dc.date.accessioned2010-04-23T13:31:35Z
dc.date.available2010-04-23T13:31:35Z
dc.date.issued2000-03
dc.identifier.urihttp://hdl.handle.net/1842/3402
dc.description.abstractA 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.en
dc.language.isoenen
dc.relation.ispartofseriesInformatics Report Seriesen
dc.relation.ispartofseriesEDI-INF-RR-0011en
dc.subjectInformaticsen
dc.titleLearning Inequated Range Restricted Horn Expressionsen
dc.typeTechnical Reporten


Files in this item

This item appears in the following Collection(s)

Show simple item record