Hussain, S: Learnability Results for Elementary Formal Syste EFS and Prolog programs
-
- Englisch ausgewählt
Fr. 76.90
inkl. gesetzl. MwSt.,
Beschreibung
Produktdetails
Einband
Taschenbuch
Erscheinungsdatum
01.03.2009
Verlag
VDMSeitenzahl
80
Maße (L/B/H)
21.7/15/1.3 cm
Gewicht
123 g
Sprache
Englisch
ISBN
978-3-639-12201-5
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.
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.
Kundinnen und Kunden meinen
Verfassen Sie die erste Bewertung zu diesem Artikel
Helfen Sie anderen Kund*innen durch Ihre Meinung