Abstract
In [1] we propose interchangeability based algorithms as methods for solving the case adaptation for the domain of problems which can be expressed as Constraint Satisfaction Problems. In this paper we extend the domain to Soft Constraint Satisfaction Problems and give generic adaptation methods based on soft interchangeability concepts.
Many real-life problems require the use of preferences. This need motivates for the use of soft constrains which allows the use of preferences.
We have defined interchangeability for soft CSPs in [2] by introducing two notions: (δ/α)substitutability/interchangeability and their algorithms. This paper presents howto build generic adaptation methods based on soft interchangeability. It gives an example of an application of a sales manager system for a car configuration domain and reports test results regarding number of (δ/α)interchangeability in random generated problems, thus number of adaptation alternatives.
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
Nicoleta Neagu and Boi Faltings. Exploiting Interchangeabilities for Case Adaptation. In Proc. of the 4th ICCBR01, 2001.
Stefano Bistarelli, Boi Faltings, and Nicoleta Neagu. A Definition of Interchangeability for Soft CSPs. In ERCIM Workshop(to appear)., Cork, Ireland, 2002.
Van Hentenryck. Generality versus Specificity:An Experience with AI and OR Techniques. In AAAI-88: Proceedings National Conference on Artificial Intelligence, pages 660–664, 1988.
R Dechter Y. 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.
T. Schiex. Probabilistic constraint satisfaction problems, or "how to handle soft constraints?" In Proc. 8th Conf. of Uncertanty in AI, 269–275, 1992.
Stefano Bistarelli, Ugo Montanari, and Francesca Rossi. Semiring-based Constraint Solving and Optimization. Journal of ACM., 44, n.2:201–236, 1997.
Stefano Bistarelli, Boi Faltings, and Nicoleta Neagu. Interchangeability in Soft CSPs. In Proc. of the 8th CP-2002., Ithaca, NY, USA, 2002.
E.C. Freuder and R.J. Wallace. Partial constraint satisfaction. AI Journal, 58, 1992.
D. Dubois, H. Fargier, and H. Prade. The calculus of fuzzy restrictions as a basis for flexible constraint satisfaction. In Proc. IEEE International Conference on Fuzzy Systems, pages 1131–1136. IEEE, 1993.
Zs. Ruttkay. Fuzzy constraint satisfaction. In Proc. 3rd IEEE International Conference on Fuzzy Systems, pages 1263–1268, 1994.
H. Fargier and J. Lang. Uncertainty in constraint satisfaction problems: a probabilistic approach. In Proc. European Conference on Symbolic and Qualitative Approaches to Reasoning and Uncertainty (ECSQARU), volume 747 of LNCS, pages 97–104. Springer-Verlag, 1993.
T. Schiex, H. Fargier, and G. Verfaille. Valued Constraint Satisfaction Problems: Hard and Easy Problems. In Proc. IJCAI95, pages 631–637, San Francisco, CA, USA, 1995. Morgan Kaufmann.
S. Bistarelli, U. Montanari, and F. Rossi. Semiring-based Constraint Solving and Optimization. Journal of the ACM, 44(2):201–236, Mar 1997.
S. Bistarelli, U. Montanari, and F. Rossi. Semiring-based Constraint Logic Programming: Syntax and Semantics. ACM Transactions on Programming Languages and System (TOPLAS), 23:1–29, jan 2001.
Eugene C. Freuder. Eliminating InterchangeableValues in Constraint Satisfaction Problems. In In Proc. of AAAI-91, pages 227–233, Anaheim, CA, 1991.
S. Bistarelli, B. Faltings, and N. Neagu. A definition of interchangeability for soft csps. In Proc. of the Joint Workshop of the ERCIM Working Group on Constraints and the CologNet area on Constraint and Logic Programming on Constraint Solving and Constraint Logic Programming— Selected Papers, LNAI. Springer-Verlag, 2002.
Berthe Choueiry Boi Faltings, Rainer Weigel. Abstraction by Interchangeability in Resource Allocation. In Proc. of the 14 th IJCAI-95, pages 1694–1701, Montreal, Canada, 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.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Neagu, N., Faltings, B. (2003). Soft Interchangeability for Case Adaptation. In: Ashley, K.D., Bridge, D.G. (eds) Case-Based Reasoning Research and Development. ICCBR 2003. Lecture Notes in Computer Science(), vol 2689. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45006-8_28
Download citation
DOI: https://doi.org/10.1007/3-540-45006-8_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40433-0
Online ISBN: 978-3-540-45006-1
eBook Packages: Springer Book Archive