Interchangeability in soft CSPs

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

Volumn 2627, Issue , 2003, Pages 31-46

  Bistarelli, Stefano ^a,b   Faltings, Boi ^c   Neagu, Nicoleta ^c  

^a Istituto di informatica e telematica del Consiglio nazionale delle ricerche   (Italy)

^b Università degli studi Gd Annunzio   (Italy)

^c EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTER CIRCUITS; COMPUTER PROGRAMMING LANGUAGES; HEURISTIC ALGORITHMS; LOGIC PROGRAMMING; ABSTRACTING; ALGORITHMS; COMPUTATIONAL METHODS; HEURISTIC METHODS; THEOREM PROVING;

ABSTRACTION TECHNIQUES; HARD CONSTRAINTS; SEARCH HEURISTICS; SOFT CONSTRAINT SATISFACTION;

CONSTRAINT SATISFACTION PROBLEMS; CONSTRAINT THEORY;

CONSTRAINT SATISFACTION PROBLEMS (CSP0; INTERCHANGEABILITY; SEARCH HEURISTICS; SOFT CONSTRAINT SATISFACTION PROBLEMS (SCSP);

EID: 7044247315     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36607-5_3     Document Type: Conference Paper

References (20)

1. Benson, B., Freuder, E.: Interchangeability preprocessing can improve forward checking search. In: Proc. of the 10th ECAI, Vienna, Austria. (1992) 28–30
2. Bistarelli, S.: Soft Constraint Solving and programming: a general framework. PhD thesis, Dipartimento di Informatica, Università di Pisa, Italy (2001)
3. Bistarelli, S., Fargier, H., Montanari, U., Rossi, F., Schiex, T., Verfaillie, G.: Semiring-based CSPs and Valued CSPs: Frameworks, properties, and comparison. CONSTRAINTS: An international journal. Kluwer 4 (1999)
4. Bistarelli, S., Montanari, U., Rossi, F.: Constraint Solving over Semirings. In: Proc. IJCAI95, San Francisco, CA, USA, Morgan Kaufman (1995)
5. Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based Constraint Solving and Optimization. Journal of the ACM 44 (1997) 201–236
6. Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based Constraint Logic Programming: Syntax and Semantics. ACM Transactions on Programming Languages and System (TOPLAS) 23 (2001) 1–29
7. Bistarelli, S., Montanari, U., Rossi, F.: Soft concurrent constraint programming. In: Proc. ESOP, 2002, Grenoble, France. LNCS, Springer-Verlag (2002)
8. Choueiry, B.Y.: Abstraction Methods for Resource Allocation. PhD thesis, EPFL PhD Thesis no 1292 (1994)
9. Choueiry, B.Y., Noubir, G.: On the computation of local interchangeability in discrete constraint satisfaction problems. In: Proc. of AAAI-98. (1998) 326–333
10. Dubois, D., Fargier, H., Prade, H.: The calculus of fuzzy restrictions as a basis for flexible constraint satisfaction. In: Proc. IEEE International Conference on Fuzzy Systems, IEEE (1993) 1131–1136
11. Fargier, H., Lang, J.: 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., Springer-Verlag (1993) 97–104
12. Freuder, E.C.: Eliminating interchangeable values in constraint satisfaction problems. In: Proc. of AAAI-91, Anaheim, CA (1991) 227–233
13. Freuder, E., Wallace, R.: Partial constraint satisfaction. AI Journal 58 (1992)
14. Haselbock, A.: Exploiting interchangeabilities in constraint satisfaction problems. In: Proc. of the 13th IJCAI. (1993) 282–287
15. Neagu, N., Faltings, B.: Exploiting interchangeabilities for case adaptation. In: In Proc. of the 4th ICCBR01. (2001)
16. Ruttkay, Z.: Fuzzy constraint satisfaction. In: Proc. 3rd IEEE International Conference on Fuzzy Systems. (1994) 1263–1268
17. Schiex, T.: Possibilistic constraint satisfaction problems, or “how to handle soft constraints?”. In: Proc. 8th Conf. of Uncertainty in AI. (1992) 269–275
18. Schiex, T., Fargier, H., Verfaille, G.: Valued Constraint Satisfaction Problems: Hard and Easy Problems. In: Proc. IJCAI95, San Francisco, CA, USA, Morgan Kaufmann (1995) 631–637
19. Weigel, R., Faltings, B.: Interchangeability for case adaptation in configuration problems. In: Proc. of the AAAI98 Spring Symposium on Multimodal Reasoning, Stanford, CA. (1998) TR SS-98-04.
20. Weigel, R., Faltings, B.: Compiling constraint satisfaction problems. Artificial Intelligence 115 (1999) 257–289