Automatically generating abstractions for problem solving
Automatically generating abstractions for problem solving
Proceedings of the first international conference on Artificial intelligence planning systems
A critical look at Koblock's hierarchy mechanism
Proceedings of the first international conference on Artificial intelligence planning systems
Tree subsumption: reasoning with outlines
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Artificial Intelligence
Automatically generating abstractions for planning
Artificial Intelligence
Downward refinement and the efficiency of hierarchical problem solving
Artificial Intelligence
Artificial Intelligence
ABSFOL: A Proof Checker with Abstraction
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Planning with abstraction hierarchies can be exponentially less efficient
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Computing abstraction hierarchies by numerical simulation
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Abstracting Visual Percepts to Learn Concepts
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
Perceptual Learning and Abstraction in Machine Learning
ICCI '03 Proceedings of the 2nd IEEE International Conference on Cognitive Informatics
Hi-index | 0.00 |
Many experimental and theoretical results have been provided whichanalyze the effects of Abstrips abstractions in search problems.Some of these results are positive, i.e. show gains inefficiency; some are negative and seem to contradict, at leastpartially, the positive results. The aim of this note is to providean analysis of how Abstrips abstractions work, and use it toprovide an explanation of the main results which can be found inthe literature.