The use of abstraction in problem solving is an effective approach to reducing search, but finding good abstractions is a difficult problem, even for people. This paper identifies a criterion for se-lecting useful abstractions, describes a tractable algorithm for generating them, and empirically demonstrates that the abstractions reduce search. The abstraction learner, called ALPINE, is inte-grated with the PRODIGY problem solver [Minton et ab., 1989b, Carbonell et al., 19901 and has been tested on large problem sets in multiple domains
This paper addresses the problem of how to implement a proactive behavior according to a two-tiered...
This article surveys the field of Artificial Intelligence for theories of abstraction. We identify ...
ion Spaces Thomas Ellman Saibal Patra Department of Computer Science Hill Center for Mathematical S...
A quantitative model of abstraction in problem solving is presented which explains how and to what e...
The use of abstraction in problem solving is an effective approach to reducing search, but finding g...
The use of abstraction in problem solving is an effective approach to reducing search, but finding g...
AbstractThis paper presents a new perspective on the traditional AI task of problem solving and the ...
The aim of this work is to show the usefulness of abstraction in heuristic search. We use the abstra...
ion Hierarchies for Constraint Satisfaction by Clustering Approximately Equivalent Objects Thomas ...
Most existing abstraction algorithms are sensitive to the initial problem formulation. Given two dif...
Knobtock and Korf have determined that abstraction can reduce search at a single agent from exponent...
This paper presents a common algorithmic framework encompassing the two main methods for using an ab...
Knoblock and Korf have determined that abstraction can reduce search at a single agent from exponent...
The purpose of this study was to deepen and elaborate the understanding of the processes of construc...
Hillclimbing search has been shown to be useful for solving constraint satisfaction problems that ar...
This paper addresses the problem of how to implement a proactive behavior according to a two-tiered...
This article surveys the field of Artificial Intelligence for theories of abstraction. We identify ...
ion Spaces Thomas Ellman Saibal Patra Department of Computer Science Hill Center for Mathematical S...
A quantitative model of abstraction in problem solving is presented which explains how and to what e...
The use of abstraction in problem solving is an effective approach to reducing search, but finding g...
The use of abstraction in problem solving is an effective approach to reducing search, but finding g...
AbstractThis paper presents a new perspective on the traditional AI task of problem solving and the ...
The aim of this work is to show the usefulness of abstraction in heuristic search. We use the abstra...
ion Hierarchies for Constraint Satisfaction by Clustering Approximately Equivalent Objects Thomas ...
Most existing abstraction algorithms are sensitive to the initial problem formulation. Given two dif...
Knobtock and Korf have determined that abstraction can reduce search at a single agent from exponent...
This paper presents a common algorithmic framework encompassing the two main methods for using an ab...
Knoblock and Korf have determined that abstraction can reduce search at a single agent from exponent...
The purpose of this study was to deepen and elaborate the understanding of the processes of construc...
Hillclimbing search has been shown to be useful for solving constraint satisfaction problems that ar...
This paper addresses the problem of how to implement a proactive behavior according to a two-tiered...
This article surveys the field of Artificial Intelligence for theories of abstraction. We identify ...
ion Spaces Thomas Ellman Saibal Patra Department of Computer Science Hill Center for Mathematical S...