Adaptation-guided retrieval: questioning the similarity assumption in reasoning
Artificial Intelligence
Using Configuration Techniques for Adaptation
Case-Based Reasoning Technology, From Foundations to Applications
Techniques and Knowledge Used for Adaptation During Case-Based Problem Solving
IEA/AIE '98 Proceedings of the 11th International Conference on Industrial and Engineering Applications of Artificial In telligence and Expert Systems: Tasks and Methods in Applied Artificial Intelligence
Functional Unification Grammar: a formalism for machine translation
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Artificial Intelligence - Special issue on nonmonotonic reasoning
Retrieval, reuse, revision and retention in case-based reasoning
The Knowledge Engineering Review
Case-Based Plan Adaptation: An Analysis and Review
IEEE Intelligent Systems
Belief Merging-Based Case Combination
ICCBR '09 Proceedings of the 8th International Conference on Case-Based Reasoning: Case-Based Reasoning Research and Development
On Similarity Measures Based on a Refinement Lattice
ICCBR '09 Proceedings of the 8th International Conference on Case-Based Reasoning: Case-Based Reasoning Research and Development
Building and refining abstract planning cases by change of representation language
Journal of Artificial Intelligence Research
A domain-independent algorithm for plan adaptation
Journal of Artificial Intelligence Research
Unify and merge in fluid construction grammar
EELC'06 Proceedings of the Third international conference on Emergence and Evolution of Linguistic Communication: symbol Grounding and Beyond
Amalgam-Based reuse for multiagent case-based reasoning
ICCBR'11 Proceedings of the 19th international conference on Case-Based Reasoning Research and Development
| Hi-index | 0.00 |
How to reuse or adapt past solutions to new problems is one of the least understood problems in case-based reasoning. In this paper we will focus on the problem of how to combine solutions coming from multiple cases in search-based approaches to reuse. For that purpose, we introduce the notion of amalgam. Assuming the solution space can be characterized as a generalization space, an amalgam of two solutions is a third solution which combines as much as possible from the original two solutions. In the paper we define amalgam as a formal operation over terms in a generalization space, and we discuss how amalgams may be applied in search-based reuse techniques to combine case solutions.