On the Computation of Local Interchangeability in Soft Constraint Satisfaction Problems

Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSPs and we introduced two notions of relaxations based on degradation δ and on threshold α (δ neighborhood interchangeability (αNI )and αneighborhood interchangeability δ NI ). In this paper we study the presence of these relaxed version of interchangeability in random soft CSPs. We give a description of the implementation we used to compute interchangeabilities and to make the tests. The experiments show that there is high occurrence of αNI and δ NI interchangeability around optimal solution in Fuzzy CSP and weighted CSPs. Thus, these algorithms can be used succesfully in solution update applications. Moreover, it is also showed that NI interchangeability can well approximate full interchangeability (FI ).

• Type: Conference
• Year: 2003
• Where: FLAIRS
• Authors: Nicoleta Neagu, Stefano Bistarelli, Boi Faltings
• Keywords: Artificial Intelligence, FLAIRS 2003, Neighborhood Interchangeability, NI Interchangeability, Soft Csps