BMWk revisited generalization and formalization of an algorithm for detecting recursive relations in term sequences
Identifieur interne : 001576 ( Istex/Curation ); précédent : 001575; suivant : 001577BMWk revisited generalization and formalization of an algorithm for detecting recursive relations in term sequences
Auteurs : Guillaume Le Blanc [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: As several works in Machine Learning (particularly in Inductive Logic Programming) have focused on building recursive definitions from examples, this paper presents a formalization and a generalization of the BMWk methodology, which stems from program synthesis from examples, ten years ago. The framework of the proposed formalization is term rewriting. It allows to state some theoretical results on the qualities and limitations of the method.
Url:
DOI: 10.1007/3-540-57868-4_58
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001595
Links to Exploration step
ISTEX:5E80BD01EC9702C07DC69D218FBE010162A554BELe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">BMWk revisited generalization and formalization of an algorithm for detecting recursive relations in term sequences</title><author><name sortKey="Le Blanc, Guillaume" sort="Le Blanc, Guillaume" uniqKey="Le Blanc G" first="Guillaume" last="Le Blanc">Guillaume Le Blanc</name><affiliation wicri:level="1"><mods:affiliation>LRI, URA 410 du CNRS, Université de Paris-Sud, Bâtiment 490, F-91405, Orsay Cedex, France</mods:affiliation><country xml:lang="fr">France</country><wicri:regionArea>LRI, URA 410 du CNRS, Université de Paris-Sud, Bâtiment 490, F-91405, Orsay Cedex</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: Guillaume.Le-Blanc@lri.fr</mods:affiliation><country wicri:rule="url">France</country></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:5E80BD01EC9702C07DC69D218FBE010162A554BE</idno><date when="1994" year="1994">1994</date><idno type="doi">10.1007/3-540-57868-4_58</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-3XXFW3F7-0/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001595</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001595</idno><idno type="wicri:Area/Istex/Curation">001576</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">BMWk revisited generalization and formalization of an algorithm for detecting recursive relations in term sequences</title><author><name sortKey="Le Blanc, Guillaume" sort="Le Blanc, Guillaume" uniqKey="Le Blanc G" first="Guillaume" last="Le Blanc">Guillaume Le Blanc</name><affiliation wicri:level="1"><mods:affiliation>LRI, URA 410 du CNRS, Université de Paris-Sud, Bâtiment 490, F-91405, Orsay Cedex, France</mods:affiliation><country xml:lang="fr">France</country><wicri:regionArea>LRI, URA 410 du CNRS, Université de Paris-Sud, Bâtiment 490, F-91405, Orsay Cedex</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: Guillaume.Le-Blanc@lri.fr</mods:affiliation><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><title level="s" type="abbrev">Lect Notes Comput Sci</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: As several works in Machine Learning (particularly in Inductive Logic Programming) have focused on building recursive definitions from examples, this paper presents a formalization and a generalization of the BMWk methodology, which stems from program synthesis from examples, ten years ago. The framework of the proposed formalization is term rewriting. It allows to state some theoretical results on the qualities and limitations of the method.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001576 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd -nk 001576 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Istex
|étape= Curation
|type= RBID
|clé= ISTEX:5E80BD01EC9702C07DC69D218FBE010162A554BE
|texte= BMWk revisited generalization and formalization of an algorithm for detecting recursive relations in term sequences
}}
| This area was generated with Dilib version V0.6.33. |  |