Abstract
While there are many general methods for case retrieval, case adaptation usually requires problem-specific knowledge and it is still an open problem. In this paper we propose a general method for solving case adaptation problems for the large class of problems which can be formulated as Constraint Satisfaction Problems. This method is based on the concept of interchangeability between values in problem solutions. The method is able to determine how change propagates in a solution set and generate a minimal set of choices which need to be changed to adapt an existing solution to a new problem.
The paper presents the proposed method, algorithms and test results for a resource allocation domain.
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
D. Leake. Case-Based Reasoning: Experiences,Lessons and Future Directions. InAAAI Press, 1996.
E. Freuder. Constraint-based Reasoning. MIT Press, 1994.
Van Hentenryck. Generality versus Specificity:An Experience withAI and ORTechniques. In AAAI-88: Proceedings National Conference on Artificial Intelligence, pages 660–664, 1988.
R. DechterY. El Fattah. Diagnosing tree-decomposable circuits. In Proc. of the 14 th IJCAI, pg. 1742–1748, 1995.
H. Krautz and B. Selman. Planning as Satisfiability. In Proc. of the 10 th Ecai, pages 359–363, Vienna, Austria, 1992.
M. Wallace. Applying constraints for scheduling. In Constraint Programming, volume 131 of NATO ASI Series Advanced Science Institute Series. Springer Verlag, 1994.
A. Mackworth. Constraint-based Design of Embeded Intelligent Systems. In Constraints 2(1), pages 83–86, Vienna, Austria, 1992.
R. Weigel and B. Faltings. Interchangeability for Case Adaptation in Configuration Problems. In Proceedings of the AAAI98 Spring Symposium on Multimodal Reasoning, Stanford, CA, TR SS-98-04., 1998.
E. C. Freuder. Eliminating Interchangeable Values in Constraint Satisfaction Problems. In In Proc. of AAAI-91, pages 227–233, Anaheim, CA, 1991.
B. Y. Choueiry and G. Noubir. On the Computation of Local Interchangeability in Discrete Constraint Satisfaction Problems. In Proc. of AAAI-98, pages 326–333, Madison,Wiscowsin, 1998.
Z. Ruttkay. Fuzzy Constraint Satisfaction. In 3rd IEEE Int. Conf. on Fuzzy Systems, pages 1263–1268, 1994.
N. Neagu and B. Faltings. Constraint Satisfaction for Case Adaptation. Proceedings of the Workshops at ICCBR’99, pages III35–III41, 1999.
B. Choueiry B. Faltings, R. Weigel. Abstraction by Interchangeability in Resource Allocation. In Proc. of the 14 th IJCAI-95, pages 1694–1701, Montreal, Canada, 1995.
B.W. Benson and E. Freuder. Interchangeability Preprocessing can Improve Forward Checking-Search. In Proc. of the 10 th Ecai, pages 28–30, Vienna, Austria, 1992.
B. Faltings K. Hua and I. Smith. CADRE: case-based geometric design. In Artificial Intelligence in Engineering 10, pages 171–183, 1996.
C. Lottaz I. Smith and B. Faltings. Spatial composition using cases: IDIOM. In Proc. of the 1st International Conference in CBR, pages 88–97, 1995.
L. Purvis and P. Pu. Adaptation using Constraint Satisfaction Techniques. In Proc. of the 1st International Conference in CBR, pages 88–97, 1995.
A. Philips S. Minton, M. Johnson and P. Laird. Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems. In Artificial Intelligence 58, pages 88–97, 1995.
E. C. Freuder and D. Sabin. Interchangeability Supports Abstraction and Reformulation for Multi-Dimensional Constraint Satisfaction. In In Proc. of AAAI-96, pages 191–196, Portland, 1991.
A. Haselbock. Exploiting Interchangeabilities in Constraint Satisfaction Problems. In Proc. of the 13 th IJCAI, pages 282–287, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Neagu, N., Faltings, B. (2001). Exploiting Interchangeabilities for Case Adaptation. In: Aha, D.W., Watson, I. (eds) Case-Based Reasoning Research and Development. ICCBR 2001. Lecture Notes in Computer Science(), vol 2080. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44593-5_30
Download citation
DOI: https://doi.org/10.1007/3-540-44593-5_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42358-4
Online ISBN: 978-3-540-44593-7
eBook Packages: Springer Book Archive