Sub-unification: a Tool for Efficient Induction of Recursive Programs
S. Lapointe, и S. Matwin. ML92: Proceedings of the Ninth International Workshop on Machine Learning, стр. 273--281. San Francisco, CA, USA, Morgan Kaufmann Publishers Inc., (1992)
Описание
sub-unification, a technique to invert implication
%0 Conference Paper
%1 LapointeMa92
%A Lapointe, Stéphane
%A Matwin, Stan
%B ML92: Proceedings of the Ninth International Workshop on Machine Learning
%C San Francisco, CA, USA
%D 1992
%I Morgan Kaufmann Publishers Inc.
%K CRUSTACEAN analytical_ip ilp inductive_programming ip-system program_synthesis recursion
%P 273--281
%T Sub-unification: a Tool for Efficient Induction of Recursive Programs
%U http://portal.acm.org/citation.cfm?id=141975.142038
@inproceedings{LapointeMa92,
added-at = {2008-12-15T21:18:17.000+0100},
address = {San Francisco, CA, USA},
author = {Lapointe, St\'{e}phane and Matwin, Stan},
biburl = {https://www.bibsonomy.org/bibtex/20a7f5f4d0072c61938dbf4d7c15d7fbc/emanuel},
booktitle = {ML92: Proceedings of the Ninth International Workshop on Machine Learning},
description = {sub-unification, a technique to invert implication},
interhash = {3cf680c52de858383a4df45c844f9ab2},
intrahash = {0a7f5f4d0072c61938dbf4d7c15d7fbc},
keywords = {CRUSTACEAN analytical_ip ilp inductive_programming ip-system program_synthesis recursion},
pages = {273--281},
publisher = {Morgan Kaufmann Publishers Inc.},
timestamp = {2008-12-30T17:50:40.000+0100},
title = {Sub-unification: a Tool for Efficient Induction of Recursive Programs},
url = {http://portal.acm.org/citation.cfm?id=141975.142038},
year = 1992
}