On the complexity of case-based planning

DOI10.1080/09528130500283717zbMath1101.68819arXivcs/0407034OpenAlexW1524302836MaRDI QIDQ5704532

Paolo Liberatore

Publication date: 15 November 2005

Published in: Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0407034

zbMATH Keywords

computational complexitycase-based planningautomated planning

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10)

Related Items (1)

Kernel functions for case-based planning

Cites Work

• Unnamed Item
• On the computational complexity of temporal projection, planning, and plan validation
• The computational complexity of propositional STRIPS planning
• Preprocessing of intractable problems
• STRIPS: A new approach to the application of theorem proving to problem solving
• Monotonic reductions, representative equivalence, and compilation of intractable problems

This page was built for publication: On the complexity of case-based planning