High-order consistency in valued constraint satisfaction

Constraints

Volumn 10, Issue 3, 2005, Pages 283-305

  Cooper, Martin C ^a  

^a IRIT   (France)

Author keywords

Consistency enforcing; Discrete optimisation; MAX CSP; Soft constraints; Valued constraint satisfaction

Indexed keywords

GRAPH THEORY; INFORMATION ANALYSIS; MATHEMATICAL MODELS; MATHEMATICAL TECHNIQUES; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

CONSISTENCY ENFORCING; DISCRETE OPTIMIZATION; MAX-CSP; SOFT CONSTRAINTS; VALUED CONSTRAINT SATISFACTION;

CONSTRAINT THEORY;

EID: 23744456608     PISSN: 13837133     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10601-005-2240-3     Document Type: Article

References (20)

1. Bertele, U., & Brioschi, F. (1972). Nonserial Dynamic Programming. Academic Press, New York, NY, USA.
2. Bistarelli, S., Fargier, H., Montanari, U., Rossi, F., Schiex, T., & Verfaillie, G. (1999). Semiring-based CSPs and valued CSPs: Frameworks, properties and comparison. Constraints 4: 199-240.
3. Cooper, M. C. (1990). An optimal k-consistency algorithm. Artif. Intell. 41: 89-95.
4. Cooper, M. C. (1993). Interpretation of line drawings of complex objects. Image Vis. Comput. 11(2): 82-90.
5. Cooper, M. C. (1999). Linear-time algorithms for testing the realisability of line drawings of curved objects. Artif. Intell. 108: 31-67.
6. Cooper, M. C. (2003). Reduction operations in fuzzy and valued constraint satisfaction. Fuzzy Sets Syst. 134: 311-342.
7. Cooper, M. C. (2004). Cyclic consistency: A local reduction operation for binary valued constraints. Artif. Intell. 155(1-2): 69-92.
8. Cooper M. C. (2005). High-Order Consistency in Valued Constraint Satisfaction. Internal Report, IRIT, Université Toulouse III.
9. Cooper, M. C., & Schiex, T. (2004). Arc consistency for soft constraints. Artif. Intell. 154(1-2): 199-227.
10. Dechter, R. (1997). Mini-buckets: A general scheme for generating approxiamtions in automated reasoning. In Proc. IJCAI-97, Nagoya, Japan, pages 1297-1303.
11. Dechter, R. (2003). Constraint Processing. San Mateo, CA: Morgan Kaukmann.
12. Dechter, R., & Pearl, J. (1988). Network-based heuristics for constraint satisfaction problems. Artif. Intell. 34: 1-38.
13. Fargier, H., & Lang, J. (1993). Uncertainty in constraint satisfaction problems: A probabilistic approach. In Proc. ECSQARU, Springer-Verlag, LNCS 747, pages 97-104.
14. Fargier, H., Lang, J., & Schiex, T. (1993). Selecting preferred solutions in Fuzzy Constraint Satisfaction Problems. In Proc. of the 1st European Congress on Fuzzy and Intelligent Technologies.
15. Larkin, D. (2003). Semi-independent partitioning: A method for bounding the solution to COP's. In Proc. Principles and Practice of Constraint Propgramming - CP 2003, Springer-Verlag, LNCS 2833, pages 894-898.
16. Larrosa, J. (2002). On arc and node consistency in weighted CSP. In Proc. AAAI'02.
17. Larrosa, J., & Schiex, T. (2003). In the Quest of the Best Form of Local Consistency for Weighted CSP. IJCAI.
18. Rosenfeld, A., Hummel, R., & Zucker, S. (1976). Scene labelling by relaxation operations. IEEE Trans. Syst. Man Cybern. 6(6): 173-184.
19. Schiex, T. (2000). Arc consistency for soft constraints. In Proc. CP'2000, LNCS 1894, pages 411-424.
20. Schiex, T., Fargier, H., & Verfaillie, G. (1995). Valued constraint satisfaction problems: Hard and easy problems. In Proc. of the 14th IJCAI, Montreal, Canada, pages 631-637.