Abstract
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 infication (mgu) followed by a replacement, we introduce two main operators in our IFLP schema: a generalisation and an inverse replacement or property of equality. We prove that this schema is strong complete in tha 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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
P.G. Bosco, E. Giovannetti, G. Levi, C. Moiso, and C. Palamidessi. A complete semantic characterization of K-leaf, a logic language with partial functions. In Proceedings of the IEEE Symposium on Logic Programming, pages 318–327. IEEE Computer Society Press, N.W., Washington, 1987.
M. Hanus. The Integration of Functions into Logic Programming: From Theory to Practice. Journal of Logic Programming, 19–20:583–628, 1994.
J. Hernández and M.J. RamÃrez. Inverse Narrowing for the Induction of Functional Logic Programs. In Proc. Joint Conference on Declarative Programming, APPIA-GULP-PRODE’98, PAGES 379–393, 1998.
S. Hölldobler. Equational Logic Programming. In Proc. Second IEEE Symp. On Logic In Computer Science, pages 335–346. IEEE Computer Society Press, 1987.
H. Hussmann. Unification in conditional-equational theories. Technical report, Fakultät für Mathematik und Informatik, Universitat Passau, 1986.
J. Jaffar, J.-L. Lassez, and M.J. Maher. A logic programming language scheme. In D. de Groot and G. Lindstrom, editors, Logic Programming, Functions, Relations and Equations, pages 441–468. Prentice Hall, Englewood Cliffs, NJ, 1986.
K. Khan, S. Muggleton, and R. Parson. Repeat learning using predicate invention. In C.D. Page, editor, Proc. of the 8th International Workshop on Inductive Logic Programming, ILK’98, volume 1446 of Lecture Notes in Artificial Intelligence, pages 165–174. Springer-Verlag, Berlin, 1998.
J.W. Klop. Term Rewriting Systems. Handbook of Logic in Computer Science, I:1–112, 1992.
S. Muggleton. Inductive Logic Programming. New Generation Computing, 8(4):295–318, 1991.
S. Muggleton. Predicate invention and utilization. Journal of Experimental and Theoretical Artificial Intelligence, 6(1):127–130, 1994.
S. Muggleton. Inverse entailment and progol. New Generation Computing Journal, 13:245–286. 1995.
S. Muggleton. Comnpleting inverse entailment. In C.D. Page, editor, Proc. of the 8th International Workshop on Inductive Logic Programming, ILP’98, volume e1446 of Lecture Notes in Artificial Intelligence, pages 245–249. Springer-Verlag, Berlin, 1998.
S. Muggleton and W. Buntine. Machine invention of first-order predicates by inverting resolution. In S. Muggleton, editor, Inductive Logic Programming, pages 261–280. Academic Press, 1992.
U.S. Reddy. Narrowing as the Operational Semantic of Functional Languages. In Proc. Second IEEE Int’l Symp. on Logic Programming, pages 138–151. IEEE, 1985.
J.H. Siekmann. Universal unification. In 7th Int’l Conf. on Automated Deduction, volume 170 of Lecture Notes in Computer Science, pages 1–42. Springer-Verlag, Berlin, 1984.
I. Stahl. The Appropriateness of Predicate Invention as Bias Shift Operation in ILP. Machine Learning, 20:95–117, 1995.
A Varsek. Genetic Inductive Logic Progamming. PhD thesis, University of Ljubljana, Slovenia, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hernández-Orallo, J., RamÃrez-Quintana, M.J. (1999). A Strong Complete Schema for Inductive Functional Logic Programming. In: Džeroski, S., Flach, P. (eds) Inductive Logic Programming. ILP 1999. Lecture Notes in Computer Science(), vol 1634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48751-4_12
Download citation
DOI: https://doi.org/10.1007/3-540-48751-4_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66109-2
Online ISBN: 978-3-540-48751-7
eBook Packages: Springer Book Archive