Kernel functions for case-based planning

DOI10.1016/j.artint.2010.07.007zbMath1210.68104OpenAlexW2078357175MaRDI QIDQ622125

Ivan Serina

Publication date: 31 January 2011

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2010.07.007

zbMATH Keywords

case-based reasoningcase-based planningkernel functionsdomain-independent planningheuristic search for planning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Model-lite planning: case-based vs. model-based approaches

Cites Work

• A mechanical solution of Schubert's steamroller by many-sorted resolution
• Planning for conjunctive goals
• Multiset theory
• Using many-sorted logic in the object-oriented data model for fast robot task planning
• The computational complexity of propositional STRIPS planning
• Planning and learning by analogical reasoning
• On point-based temporal disjointness
• Using temporal logics to express search control knowledge for planning
• A probabilistic analysis of propositional STRIPS planning
• 10.1162/15324430260185556
• RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs
• On the complexity of case-based planning
• Bridging the Gap between Graph Edit Distance and Kernel Machines
• A survey on case-based planning
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Kernel functions for case-based planning