Access the full text.
Sign up today, get an introductory month for just $19.
R. Harper, F. Honsell, G. Plotkin (1993)
A framework for defining logicsJ. ACM, 40
Kedar Cabelli (1987)
Explanation - based Generalization as resolution theorem proving
H. Hirsh (1987)
Explanation-based Generalization in a Logic-Programming Environment
(1989)
eLP: A Common Lisp implementation of ~,Prolog in the Ergo Support System. Available via ftp over the Internet. Send mail to elp-request@cs.cmu.edu on the Internet for further information
Conal Elliott (1990)
Extensions and applications of higher-order unification
Thomas Dietterich, Bob London, K. Clarkson, G. Dromey (1982)
Learning and Inductive Inference
R.L. Constable (1986)
Implementing mathematics with the Nuprl Proof Development System
D. Miller, G. Nadathur (1987)
A Logic Programming Approach to Manipulating Formulas and Programs
J. Hannan, D. Miller (1988)
Logic programming: Proceedings of the Fifth International Conference and Symposium, Volume 2
J. Laird, A. Newell, P. Rosenbloom (1987)
SOAR: An Architecture for General IntelligenceArtif. Intell., 33
J. Shavlik (1990)
Acquiring Recursive and Iterative Concepts with Explanation-Based LearningMachine Learning, 5
G. Huet (1975)
A Unification Algorithm for Typed lambda-CalculusTheor. Comput. Sci., 1
K. Knight (1989)
Unification: A multi-disciplinary surveyACM Computing Surveys, 21
F. Pfenning, Conal Elliott (1988)
Higher-order abstract syntax
J. Hannan, D. Miller (1988)
Uses of Higher-Order Unification for Implementing Program Transformers
A. Prieditis, Jack Mostow (1987)
PROLEARN: Towards a Prolog Interpreter that Learns
W. Goldfarb (1981)
The Undecidability of the Second-Order Unification ProblemTheor. Comput. Sci., 13
H. Partsch, Ralf Steinbrüggen (1983)
Program Transformation SystemsACM Comput. Surv., 15
H. Hirsh (1989)
Incremental version-space merging: A general framework for concept learning
Fernando Pereira (1990)
Prolog and Natural-Language Analysis: Into the Third Decade
D. Angluin, Carl Smith (1983)
Inductive Inference: Theory and MethodsACM Comput. Surv., 15
Steven Minton (1988)
Quantitative Results Concerning the Utility of Explanation-based LearningArtif. Intell., 42
A. Felty, D. Miller (1988)
Specifying Theorem Provers in a Higher-Order Logic Programming Language
R. Keller (1987)
Defining Operationality for Explanation-Based LearningArtif. Intell., 35
G. Huet, B. Lang (1978)
Proving and applying program transformations expressed with second-order patternsActa Informatica, 11
S. Dietzen (1992)
A language for higher-order explanation-based learning
C. Willis, D. Paddon (1994)
Machine learning in software reuse
G. Hughes, J. Cresswell (1973)
An introduction to modal logic, 2e éd., 1 vol
S. Mahadevan, Tom Mitchell (1990)
An apprentice-based approach to learning problem-solving knowledge
Steven Minton, J. Carbonell, Craig Knoblock, D. Kuokka, Oren Etzioni, Y. Gil (1989)
Explanation-Based Learning: A Problem Solving PerspectiveArtif. Intell., 40
Thomas Dietterich (1986)
Learning at the Knowledge LevelMachine Learning, 1
H. Partsch, Steinbruggen (1983)
Program transformation systemsComputing Surveys, 15
G. DeJong, R. Mooney (1986)
Explanation-based generalization: An alternate viewMachine Learning, 1
P. Thistlewaite, M. McRobbie, R. Meyer (1988)
Automated theorem proving for non-classical logicsStudia Logica, 52
R. Burstall, J. Darlington (1977)
A Transformation System for Developing Recursive ProgramsJournal of the ACM (JACM), 24
M. Feather (1987)
A survey and classification of some program transformation approaches and techniques
Tom Mitchell, R. Keller, Smadar Kedar-Cabelli (1986)
Explanation-based generalization: A unifying viewMachine Learning, 1
G.E. Hughes, M.J. Cresswell (1968)
Introduction to modal logic
L. Sterling, E. Shapiro (1986)
The Art of Prolog - Advanced Programming Techniques
H. Hirsh (1988)
Reasoning about Operationality for Explanation-Based Learning
G. Nadathur, D. Miller (1988)
AN OVERVIEW OF PROLOG
J. Jaffar, J. Lassez (1987)
Constraint logic programming
(1987)
Analogy in program development
L. Cerro, M. Penttonen (1987)
A Note of the Complexity of the Satisfiability of Modal Horn ClausesJ. Log. Program., 4
D. Miller (1991)
A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
S. Dietzen, F. Pfenning (1992)
Higher-Order and Modal Logic as a Framework for Explanation-Based GeneralizationMachine Learning, 9
D. Miller, G. Nadathur (1986)
Some Uses of Higher-Order Logic in Computational Linguistics
A. Felty, D.A. Miller (1988)
Ninth International Conference on Automated Deduction, Argonne, Illinois
Jack Mostow (1989)
Design by Derivational Analogy: Issues in the Automated Replay of Design PlansArtif. Intell., 40
G. Huet (1975)
A unification algorithm for typed λ-calculusTheoretical Computer Science, 1
D. Angluin, C.H. Smith (1983)
Inductive inference: Theory and methodsComputing Surveys, 15
T. Ellman (1989)
Explanation-based learning: a survey of programs and perspectivesACM Comput. Surv., 21
M. Donat, L. Wallen (1988)
Learning and Applying Generalised Solutions using Higher Order Resolution
William Cohen (1988)
Generalizing Number and Learning from Multiple Examples in Explanation Based Learning
S. Dietzen, F. Pfenning (1989)
Sixth International Workshop on Machine Learning
Tom Mitchell, S. Mahadevan, L. Steinberg (2004)
The Protein Data Bank: A Case Study in Management of Community DataCurrent Proteomics, 1
Peter Lee, F. Pfenning, Gene Rollins, W. Scherlis (1988)
The ergo support system: an integrated set of tools for prototyping integrated environmentsProceedings of the third ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
L. Wallen (1990)
Automated proof search in non-classical logics - efficient matrix proof methods for modal and intuitionistic logics
L. Cerro (1986)
MOLOG: A system that extends PROLOG with modal logicNew Generation Computing, 4
Certain tasks, such as formal program development and theorem proving, fundamentally rely upon the manipulation of higher-order objects such as functions and predicates. Computing tools intended to assist in performing these tasks are at present inadequate in both the amount of ‘knowledge’ they contain (i.e., the level of support they provide) and in their ability to ‘learn’ (i.e., their capacity to enhance that support over time). The application of a relevant machine learning technique—explanation-based generalization (EBG)—has thus far been limited to first-order problem representations. We extend EBG to generalize higher-order values, thereby enabling its application to higher-order problem encodings.
Machine Learning – Springer Journals
Published: Dec 30, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get an introductory month for just $19.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.