Treffer: A strong complete schema for inductive functional logic programming

Title:
A strong complete schema for inductive functional logic programming
Authors:
HERNANDEZ-ORALLO, J, RAMIREZ-QUINTANA, M. J
Source:
ILP-99 : inductive logic programming (Bled, 24-27 June 1999)Lecture notes in computer science. :116-127
Publisher Information:
Berlin: Springer, 1999.
Publication Year:
1999
Physical Description:
print, 17 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Intelligence artificielle, Artificial intelligence, Apprentissage et systèmes adaptatifs, Learning and adaptive systems, Analyse algorithme, Algorithm analysis, Análisis algoritmo, Performance algorithme, Algorithm performance, Resultado algoritmo, Programmation fonctionnelle, Functional programming, Programación funcional, Programmation logique, Logical programming, Programación lógica, Système apprentissage, Learning systems
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
DSIC, UPV, Camino de Vera s/n, 46020 Valencia, Spain
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=1822905
Rights:
Copyright 1999 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.1822905
Database:
PASCAL Archive

Weitere Informationen

A new IFLP schema is presented as a general framework for the induction of functional logic programs (FLP). Since narrowing (which is the most usual operational semantics of FLP) performs a unification (mgu) followed by a replacement, we introduce two main operators in our IFLP schema: a generalisation and an inverse replacement or intra-replacement, which results in a generic inversion of the transitive property of equality. We prove that this schema is strong complete in the way that, given some evidence, it is possible to induce any program which could have generated that evidence. We outline some possible restrictions in order to improve the tractability of the schema. We also show that inverse narrowing is just a special case of our IFLP schema. Finally, a straightforward extension of the IFLP schema to function invention is illustrated.