Abstract
The majority of case-based planning systems consider an infinite case memory to store their cases. However, the size of the case memory is limited and it can become a barrier for case-based systems efficiency when it is full. This paper presents a method that refines and abstracts cases in order to release memory space for a new case. However, in some situations, some cases must be chosen to be deleted, and the method incorporates a case-deletion policy that achieves a lower bound for coverage depletion. Besides this paper can deal with a limited quantity of memory to store cases, the case-deletion policy also reaches better results for coverage-preserving than the case-addition policy pro-posed by Zhu and Yang [11].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bergmann, R. and Wilke, W.: Building and refitting abstract planning cases by change of representation language. Journal of Artificial Intelligence Research 3 (1995) 53–118.
Bonner, A.J. and Kifer, M.: Transaction logic programming. Technical Report, CSRI-323, Department of Computer Science, University of Toronto (1995).
Francis, A.G. and Ram A.: The Utility Problem in Case-Based Reasoning. Technical Report (ER-93-08). Georgia Institute of Technology, USA (1993).
Koehler, J.: Planning from Second Principles. Artificial Intelligence, 87. Elsevier Science. (1996).
Kolodner, J.L.: Case-Based Reasoning. Morgan Kaufmann. (1993).
Minton, S.: Qualitative Results Concerning the Utility of Explanation-based Learning. Artificial Intelligence, 42 (1990) 363–391.
Munõz-Avila, H. and Weberskirch, F.: Planning for Manufacturing Workpieces by Storing, Indexing and Replaying Planning Decisions. In: Proceedings of AIPS-96. AAAI Press. (1996)
Smyth, B. and Keane, M.: Remember to Forget: A Competence-preserving Case-deletion Policy for Case-based Reasoning Systems. In: Proceedings of the International Joint Con-ference on Artificial Intelligence IJCAI’95. (1995) 377–382.
Tonidandel, F. and Rillo, M.: Case-Based Planning in Transaction Logic Framework. In: Proceedings of the Workshop on Intelligent Manufacturing Systems (IMS’98), 5 TH IFAC. Gramado, Brazil. Elsevier Science (1999).
Veloso, M.: Learning by Analogical Reasoning in General Problem Solving. PhD thesis, Carnegie Mellon University, Pittsburgh, USA (1992)
Zhu J. and Yang Q.: Remembering to Add: Competence-preserving Case-Addition Policies for Case-Base Maintenance. In: Proceedings of the International Joint Conference on Ar-tificial Intelligence IJCAI’99. (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tonidandel, F., Rillo, M. (2000). Handling Cases and the Coverage in a Limited Quantity of Memory for Case-Based Planning Systems. In: Monard, M.C., Sichman, J.S. (eds) Advances in Artificial Intelligence. IBERAMIA SBIA 2000 2000. Lecture Notes in Computer Science(), vol 1952. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44399-1_4
Download citation
DOI: https://doi.org/10.1007/3-540-44399-1_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41276-2
Online ISBN: 978-3-540-44399-5
eBook Packages: Springer Book Archive