Abstract. Inductive Logic Programming (ilp) methods have proven to succesfully acquire knowledge in very different learning paradigms, such as supervised and unsupervised learning or relational reinforcement learning. However, very little has been done on General Problem Solving (gps). One of the ilp-based approaches applied to gps is hamlet. This method is able to learn control rules (heuristics) for a non linear planner, prodigy4.0, which is integrated into the ipss system; control rules are used as an effective guide when building the planning search tree. Other learning approaches applied to planning generate macro-operators, building high-level blocks of actions, but increasing the branching factor of the search tree. In this paper, we...
Many fully automated planning systems use a single, domain independent heuristic to guide search and...
Many complex domains and even larger problems in simple domains remain challenging in spite of the r...
Seventeenth International Conference on Machine Learning. Stanford, CA, USA, 29 June-2 July, 2000Kno...
General-purpose generative planners use domain-independent search heuristics to generate solutions f...
AbstractOne method for reducing the time required for plan generation is to learn search control rul...
Research into techniques that reformulate problems to make general solvers more efficiently derive s...
Research into techniques that reformulate problems to make general solvers more efficiently derive s...
AbstractThe purpose of this article is to present a multi-strategy approach to learn heuristics for ...
Abstract—Planning techniques recorded a significant progress during recent years. However, many pla...
The purpose of this article is to present a multi-strategy approach to learn heuristics for planning...
As any other problem solving task that employs search, AI Planning needs heuristics to efficiently g...
As any other problem solving task that employs search, AI Planning needs heuristics to efficiently g...
The work described in this paper addresses learning planning operators by observing expert agents an...
Despite recent progress in planning, many complex domains and even larger problems in simple domains...
Despite recent progress in planning, many complex domains and even larger problems in simple domains...
Many fully automated planning systems use a single, domain independent heuristic to guide search and...
Many complex domains and even larger problems in simple domains remain challenging in spite of the r...
Seventeenth International Conference on Machine Learning. Stanford, CA, USA, 29 June-2 July, 2000Kno...
General-purpose generative planners use domain-independent search heuristics to generate solutions f...
AbstractOne method for reducing the time required for plan generation is to learn search control rul...
Research into techniques that reformulate problems to make general solvers more efficiently derive s...
Research into techniques that reformulate problems to make general solvers more efficiently derive s...
AbstractThe purpose of this article is to present a multi-strategy approach to learn heuristics for ...
Abstract—Planning techniques recorded a significant progress during recent years. However, many pla...
The purpose of this article is to present a multi-strategy approach to learn heuristics for planning...
As any other problem solving task that employs search, AI Planning needs heuristics to efficiently g...
As any other problem solving task that employs search, AI Planning needs heuristics to efficiently g...
The work described in this paper addresses learning planning operators by observing expert agents an...
Despite recent progress in planning, many complex domains and even larger problems in simple domains...
Despite recent progress in planning, many complex domains and even larger problems in simple domains...
Many fully automated planning systems use a single, domain independent heuristic to guide search and...
Many complex domains and even larger problems in simple domains remain challenging in spite of the r...
Seventeenth International Conference on Machine Learning. Stanford, CA, USA, 29 June-2 July, 2000Kno...