A review of machine learning for automated planning

S Jiménez, T De La Rosa, S Fernández… - The Knowledge …, 2012 - cambridge.org
Recent discoveries in automated planning are broadening the scope of planners, from toy
problems to real applications. However, applying automated planners to real-world …

Explanation-based learning: A survey of programs and perspectives

T Ellman - ACM Computing Surveys (CSUR), 1989 - dl.acm.org
Explanation-based learning (EBL) is a technique by which an intelligent system can learn by
observing examples. EBL systems are characterized by the ability to create justified …

[图书][B] Cognition and safety: an integrated approach to systems design and assessment

O Sträter - 2016 - taylorfrancis.com
Safety suffers from the variety of methods and models that are used to assess human
performance. For example, operation is concerned primarily with human error, while design …

[图书][B] Goal-driven learning

A Ram, DB Leake - 1995 - books.google.com
Brings together a diversity of research on goal-driven learning to establish a broad,
interdisciplinary framework that describes the goal-driven learning process. In cognitive …

Defining operationality for explanation-based learning

RM Keller - Artificial Intelligence, 1988 - Elsevier
Operationality is the key property that distinguishes the final description learned in an
explanation-based system from the initial concept description input to the system. Yet most …

Design by derivational analogy: Issues in the automated replay of design plans

J Mostow - Artificial Intelligence, 1989 - Elsevier
Derivational analogy solves a problem by replaying the plan used to solve a previous
problem, modifying it where necessary. We analyze how four published systems use this …

Goal-based explanation evaluation

DB Leake - Cognitive Science, 1991 - Elsevier
Many theories of explanation evaluation are based on context-independent criteria. Such
theories either restrict their consideration to explanation towards a fixed goal, or assume that …

Machine discovery of effective admissible heuristics

AE Prieditis - Machine learning, 1993 - Springer
Admissible heuristics are an important class of heuristics worth discovering: they guarantee
shortest path solutions in search algorithms such as A* and they guarantee less expensively …

Learning, goals, and learning goals

A Ram, DB Leake - 1995 - direct.mit.edu
In cognitive science, artificial intelligence, psychology, and education, a growing body of
research supports the view that learning is largely a goal-directed process. Experimental …

A theory of justified reformulations

D Subramanian - Proceedings of the sixth international workshop on …, 1989 - Elsevier
Present day systems, intelligent or otherwise, are limited by the conceptualizations of the
world given to them by their designers. In this paper, we propose a novel, first-principles …