A maximal tractable class of soft constraints

Journal of Artificial Intelligence Research

Volumn 22, Issue , 2004, Pages 1-22

  Cohen, David ^a   Cooper, Martin ^b   Jeavons, Peter ^c   Krokhin, Andrei ^d  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b IRIT   (France)

^c UNIVERSITY OF OXFORD   (United Kingdom)

^d UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY CODES; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; FUNCTIONS; PROBLEM SOLVING;

BINARY CONSTRAINTS; OPTIMAL SOLUTION; TRACTABLE CLASS;

ARTIFICIAL INTELLIGENCE;

EID: 22344450441     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1400     Document Type: Article

References (32)

1. Allen, J. (1995). Natural Language Understanding - 2nd Edition. The Benjamin/Cummings Publishing Company.
2. Bistarelli, S., Montanari, U., Rossi, F., Schiex, T., Verfaillie, G., & Fargier, H.(1999). Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison. Constraints, 4, 199-240.
3. Bulatov, A.(2003). Tractable conservative constraint satisfaction problems. In Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science (LICS'03), pp. 321-330.
4. Bistarelli, S., Montanari, U., & Rossi, F. (1997). Semiring-based constraint satisfaction and optimisation. Journal of the ACM, 44, 201-236.
5. Burkard, R., Klinz, B., & Rudolf, R. (1996). Perspectives of Monge properties in optimization. Discrete Applied Mathematics, 70, 95-161.
6. Cohen, D., Cooper, M., Jeavons, P., & Krokhin, A. (2003). Soft constraints: Complexity and multimorphisms. In Proceedings of 9th International Conference on Principles and Practice of Constraint Programming (CP'03), Vol. 2833 of Lecture Notes in Computer Science, pp. 244-258. Springer-Verlag.
7. Cooper, M. (2003). Reduction operations in fuzzy or valued constraint satisfaction. Fuzzy Sets and Systems, 134, 311-342.
8. Creignou, N., Khanna, S., & Sudan, M. (2001). Complexity Classifications of Boolean Constraint Satisfaction Problems, Vol. 7 of SIAM Monographs on Discrete Mathematics and Applications.
9. Dahlhaus, E., Johnson, D., Papadimitriou, C., Seymour, P., & Yannakakis, M. (1994). The complexity of multiterminal cuts. SIAM Journal on Computing, 23(4), 864-894.
10. Deville, Y., Barette, O., & van Hentenryck, P. (1999). Constraint satisfaction over connected row convex constraints. Artificial Intelligence, 109, 243-271.
11. Feder, T., & Vardi, M. (1998). The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM Journal of Computing, 28, 57-104.
12. Freuder, E., &: Wallace, R. (1992). Partial constraint satisfaction. Artificial Intelligence, 58, 21-70.
13. Fujishige, S. (1991). Submodular Functions and Optimization, Vol. 47 of Annals of Discrete Mathematics. North-Holland, Amsterdam.
14. Goldberg, A., & Tarjan, R. (1988). A new approach to the maximum flow problem. Journal of the ACM, 35, 921-940.
15. Iwata, S., Fleischer, L., & Fujishige, S. (2001). A combinatorial strongly polynomial algorithm for minimizing submodular functions. Journal of the ACM, 48, 761-777.
16. Jeavons, P., Cohen, D., & Gyssens, M. (1997). Closure properties of constraints. Journal of the ACM, 44, 527-548.
17. Kautz, H., & Selman, B. (1992). Planning as satisfiability. In Proceedings of the Tenth European Conference on Artificial Intelligence (ECAI'92), pp. 359-363.
18. Khanna, S., Sudan, M., Trevisan, L., & Williamson, D. (2000). The approximability of constraint satisfaction problems. SIAM Journal on Computing, 50(6), 1863-1920.
19. Khatib, L., Morris, P., Morris, R., & Rossi, F. (2001). Temporal constraint reasoning with preferences. In Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI-01), pp. 322-327, Seattle, USA.
20. Larrosa, J., Meseguer, P., & Schiex, T. (1999). Maintaining Reversible DAC for Max-CSP. Artificial Intelligence, 107(1), 149-163.
21. Lovasz, L. (1983). Submodular functions and convexity. In Bachern, A., Grötschel, M., & Körte, B. (Eds.), Mathematical Programming - The State of the Art, pp. 235-257, Berlin. Springer-Verlag.
22. Montanari, U. (1974). Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences, 7, 95-132.
23. Nemhauser, G., & Wolsey, L. (1988). Integer and Combinatorial Optimization. John Wiley & Sons.
24. Rosenfeld, A., Hummel, R., & Zucker, S. (1976). Scene labeling by relaxation operations. IEEE Transactions on Systems, Man and Cybernetics, 6, 420-433.
25. Rudolf, R., & Woeginger, G. (1995). The cone of Monge matrices: extremal rays and applications. ZOR - Mathematical Methods of Operations Research, 42, 161-168.
26. Ruttkay, Z. (1994). Fuzzy constraint satisfaction. In Proceedings 3rd IEEE International Conference on Fuzzy Systems, pp. 1263-1268.
27. Schaefer, T. (1978). The complexity of satisfiability problems. In Proceedings 10th ACM Symposium on Theory of Computing, STOC'78, pp. 216-226.
28. Schrijver, A. (2000). A combinatorial algorithm minimizing submodular functions in strongly polynomial time. Journal of Combinatorial Theory, Series B, 80, 346-355.
29. Topkis, D. (1978). Minimizing a submodular function on a lattice. Operations Research, 26, 305-321.
30. Topkis, D. (1998). Supermodularity and Complementarity. Princeton University Press.
31. van Beek, P. (1992). Reasoning about qualitative temporal information. Artificial Intelligence, 58, 297-326.
32. van Hentenryck, P., Deville, Y., & Teng, C.-M. (1992). A generic arc-consistency algorithm and its specializations. Artificial Intelligence, 57, 291-321.