Learnability Results for Elementary Formal Systems » książka
Learnability Results for Elementary Formal Systems
ISBN-13: 9783639122015 / Angielski / Miękka / 2009 / 80 str.
Elementary formal systems are a kind of logic programs. We give a comprehensive relationship model for a broad range of classes of elementary formal systems (EFS) and Prolog Programs along with their learnability results in the frameworks of learning in the limit, learning from queries, learning from entailment, and statistical framework of probably approximately correct (PAC) learning. The relationship model accompanies the proofs of containment, partial containment, and/or incompatibilities present among these classes. Further, we study exact learning of two classes of Prolog programs (or equivalently elementary formal systems) from entailment. These two classes, hereditary and reductive, of Prolog programs without local variables contain many useful programs such as add, append, lenght, merge, split, delete, member, prefix, and suffix. We present an algorithm to exactly learn hereditary and reductive Prolog programs and analyze it for its correctness. Moreover, the algorithm learns hereditary Prolog programs in polynomial time.
Elementary formal systems are a kind of logicprograms. We give a comprehensive relationship modelfor a broad range of classes of elementary formalsystems (EFS) and Prolog Programs along with theirlearnability results in the frameworks of learningin the limit, learning from queries, learning fromentailment, and statistical framework of probablyapproximately correct (PAC) learning. Therelationship model accompanies the proofs ofcontainment, partial containment, and/orincompatibilities present among these classes.Further, we study exact learning of two classes ofProlog programs (or equivalently elementary formalsystems) from entailment. These two classes,hereditary and reductive, of Prolog programs withoutlocal variables contain many useful programs such asadd, append, lenght, merge, split, delete, member,prefix, and suffix. We present an algorithm toexactly learn hereditary and reductiveProlog programs and analyze it for its correctness.Moreover, the algorithm learns hereditary Prologprograms in polynomial time.
Czytaj nas na:
KrainaKsiazek.PL - Księgarnia Internetowa
