Soft interchangeability for case adaptation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2689, Issue , 2003, Pages 347-361

  Neagu, Nicoleta ^a   Faltings, Boi ^a  

^a EPFL   (Switzerland)

Author keywords

Case adaptation; Hard soft constraint satisfaction problems; Interchangeability; Substitutability

Indexed keywords

ALGORITHMS; CASE BASED REASONING; CONSTRAINT THEORY; PROBLEM SOLVING;

ADAPTATION METHODS; CASE ADAPTATION; CONFIGURATION DOMAINS; INTERCHANGEABILITY; REAL-LIFE PROBLEMS; SALES MANAGER; SOFT CONSTRAINT SATISFACTION; SUBSTITUTABILITY;

CONSTRAINT SATISFACTION PROBLEMS; FORMAL LOGIC;

CASE ADAPTATION; CONSTRAINT SATISFACTION PROBLEMS; GENERIC ADAPTATION; SOFT INTERCHANGEABILITY;

EID: 7044239097     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45006-8_28     Document Type: Conference Paper

References (25)

1. Nicoleta Neagu and Boi Faltings. Exploiting Interchangeabilities for Case Adaptation. In Proc. of the 4th ICCBR01, 2001.
2. Stefano Bistarelli, Boi Faltings, and Nicoleta Neagu. A Definition of Interchangeability for Soft CSPs. In ERCIM Workshop(to appear)., Cork, Ireland, 2002.
3. 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.
4. R Dechter Y. El Fattah. Diagnosing tree-decomposable circuits. In Proc. of the 14 th IJCAI, pg. 1742–1748, 1995.
5. H. Krautz and B. Selman. Planning as Satisfiability. In Proc. of the 10 th Ecai, pages 359–363, Vienna, Austria, 1992.
6. M. Wallace. Applying constraints for scheduling. In Constraint Programming, volume 131 of NATO ASI Series Advanced Science Institute Series. Springer Verlag, 1994.
7. A. Mackworth. Constraint-based Design of Embeded Intelligent Systems. In Constraints 2(1), pages 83–86, Vienna, Austria, 1992.
8. 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.
9. T. Schiex. Probabilistic constraint satisfaction problems, or "how to handle soft constraints?" In Proc. 8th Conf. of Uncertanty in AI, 269–275, 1992.
10. Stefano Bistarelli, Ugo Montanari, and Francesca Rossi. Semiring-based Constraint Solving and Optimization. Journal of ACM., 44, n.2:201–236, 1997.
11. Stefano Bistarelli, Boi Faltings, and Nicoleta Neagu. Interchangeability in Soft CSPs. In Proc. of the 8th CP-2002., Ithaca, NY, USA, 2002.
12. E.C. Freuder and R.J. Wallace. Partial constraint satisfaction. AI Journal, 58, 1992.
13. 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.
14. Zs. Ruttkay. Fuzzy constraint satisfaction. In Proc. 3rd IEEE International Conference on Fuzzy Systems, pages 1263–1268, 1994.
15. 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.
16. 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.
17. S. Bistarelli, U. Montanari, and F. Rossi. Semiring-based Constraint Solving and Optimization. Journal of the ACM, 44(2):201–236, Mar 1997.
18. 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.
19. Eugene C. Freuder. Eliminating InterchangeableValues in Constraint Satisfaction Problems. In In Proc. of AAAI-91, pages 227–233, Anaheim, CA, 1991.
20. 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.
21. 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.
22. L. Purvis and P. Pu. Adaptation using Constraint Satisfaction Techniques. In Proc. of the 1st International Conference in CBR, pages 88–97, 1995.
23. 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.
24. B. Faltings, K. Hua and I. Smith. CADRE: case-based geometric design. In Artificial Intelligence in Engineering 10, pages 171–183, 1996.
25. 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.