Domain permutation reduction for constraint satisfaction problems

Artificial Intelligence

Volumn 172, Issue 8-9, 2008, Pages 1094-1118

  Green, Martin J ^a   Cohen, David A ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Complexity; Constraint satisfaction problem; CSP; NP completeness; Renamable Horn; Stable marriage; Tractability

Indexed keywords

COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING; STATISTICAL METHODS;

CONSTRAINT SATISFACTION PROBLEM (CSP); DOMAIN PERMUTATIONS;

CONSTRAINT THEORY;

EID: 41049109707     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2007.12.001     Document Type: Article

References (50)

1. Allen J. Natural Language Understanding. The Benjamin/Cummings Publishing Company. second ed. (1995)
2. Aspvall B., Plass M.F., and Tarjan R.E. A linear time algorithm for testing the truth of certain quantified Boolean formulas. Information Processing Letters 8 (1979) 121-123
3. Aspvall B. Recognizing disguised NR(1) instances of the satisfiability problem. Journal of Algorithms 1 1 (1980) 97-103
4. Beeri C., Fagin R., Maier D., and Yannakakis M. On the desirability of acyclic database schemes. Journal of the ACM 30 (1983) 479-513
5. C. Bessière, J.-C. Régin, Arc consistency for general constraint networks: preliminary results, in: Proceedings of IJCAI'97, Nagoya, Japan, 1997, pp. 398-404
6. Boros E. Maximum renamable Horn sub-CNFs. Discrete Applied Mathematics 96-97 (1999) 29-40
7. Bulatov A., Jeavons P., and Krokhin A. Classifying the complexity of constraints using finite algebras. SIAM Journal on Computing 34 3 (2005) 720-742
8. Chandru V., and Hooker J.N. Extended Horn sets in propositional logic. Journal of the ACM 38 (1991) 205-221
9. Chandru V., Coullard C., Hammer P., Montanez M., and Sun X. On Renamable Horn and Generalized Horn functions. Annals of Mathematics and Artificial Intelligence 1 (1990) 33-48
10. E. Chen, Z. Zhang, X. Wang, K. Aihara, An algorithm for fast recognition of connected row-convex constraint networks, in: JFPLC 2001, The Tenth International French Speaking Conference on Logic and Constraint Programming, April 2001, pp. 43-58
11. Cohen D. Tractable decision for a constraint language implies tractable search. Constraints 9 3 (2004) 219-229
12. Cohen D.A. A new class of binary CSPs for which arc-consistency is a decision procedure. Principles and Practice of Constraint Programming-CP 2003. Lecture Notes in Computer Science (2003), Springer-Verlag 807-811
13. Cohen D., and Jeavons P. The complexity of constraint languages. In: Rossi F., van Beek P., and Walsh T. (Eds). Handbook of Constraint Programming (2006), Elsevier (Chapter 8)
14. Cohen D., Jeavons P., Jonsson P., and Koubarakis M. Building tractable disjunctive constraints. Journal of the ACM 47 5 (2000) 826-853
15. D.A. Cohen, P. Jeavons, M. Gyssens, A unified theory of structural tractability for constraint satisfaction and spread cut decomposition, in: IJCAI, 2005, pp. 72-77
16. Creignou N. A dichotomy theorem for maximum generalized satisfiability problems. Journal of Computer and System Sciences 51 (1995) 511-522
17. Dechter R., and Pearl J. Network-based heuristics for constraint satisfaction problems. Artificial Intelligence 34 1 (1988) 1-38
18. Dechter R., and Pearl J. Tree clustering for constraint networks. Artificial Intelligence 38 (1989) 353-366
19. del Val A. On 2-SAT and renamable Horn. AAAI: 17th National Conference on Artificial Intelligence (2000), AAAI/MIT Press 279-284
20. Deville Y., Barette O., and van Hentenryck P. Constraint satisfaction over connected row convex constraints. Artificial Intelligence 109 (1999) 243-271
21. N.W. Dunkin, J.E. Bater, P.G. Jeavons, D.A. Cohen, Toward high order constraint representations for the frequency assignment problem, Technical Report CSD-TR-98-05, Department of Computer Science, Royal Holloway, University of London, Egham, Surrey, UK, 1998
22. Fagin R. Degrees of acyclicity for hypergraphs and relational database schemes. Journal of the ACM 30 (1983) 514-550
23. Gale D., and Shapley L.S. College admissions and stability of marriage. The American Mathematical Monthly 69 1 (1962) 9-15
24. Garey M., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, San Francisco, CA
25. R.L. Gault, Polyanna technical manual (version 1.00), Technical Report RR-01-20, Computing Laboratory, Oxford University, 2001
26. Gault R.L., and Jeavons P.G. Implementing a test for tractability. Constraints 9 2 (2004) 139-160
27. Gent I.P., W Irving R., F Manlove M., Prosser P., and Smith B.M. A constraint programming approach to the stable marriage problem. Proceedings of CP 2001: the 7th International Conference on Principles and Practice of Constraint Programming. Lecture Notes in Computer Science vol. 2239 (2001), Springer-Verlag 225-239
28. Gottlob G., Leone L., and Scarcello F. A comparison of structural CSP decomposition methods. Artificial Intelligence 124 (2000) 243-282
29. Gottlob G., Leone L., and Scarcello F. Hypertree decompositions: A survey. Proceedings 26th International Symposium on Mathematical Foundations of Computer Science, MFCS'01. Lecture Notes in Computer Science vol. 2136 (2001), Springer-Verlag 37-57
30. Gottlob G., Leone L., and Scarcello F. Hypertree decomposition and tractable queries. Journal of Computer and System Sciences 64 3 (2002) 579-627
31. M.J. Green, New methods for the tractability of constraint satisfaction problems, PhD thesis, University of London, Department of Computer Science, Royal Holloway, Egham, Surrey, UK, June 2005
32. Green M.J., and Cohen D.A. Tractability by approximating constraint languages. Principles and Practice of Constraint Programming-CP 2003. Lecture Notes in Computer Science (2003), Springer-Verlag 392-406
33. Gyssens M., Jeavons P.G., and Cohen D.A. Decomposing constraint satisfaction problems using database techniques. Artificial Intelligence 66 1 (1994) 57-89
34. Jeavons P.G. On the algebraic structure of combinatorial problems. Theoretical Computer Science 200 (1998) 185-204
35. Jeavons P.G., and Cohen D.A. An algebraic characterization of tractable constraints. Computing and Combinatorics. First International Conference COCOON'95. Xi'an, China, August 1995. Lecture Notes in Computer Science vol. 959 (1995), Springer-Verlag 633-642
36. Jeavons P.G., and Cooper M.C. Tractable constraints on ordered domains. Artificial Intelligence 79 2 (1995) 327-339
37. Jeavons P.G., Cohen D.A., and Gyssens M. Closure properties of constraints. Journal of the ACM 44 (1997) 527-548
38. Jeavons P.G., Cohen D.A., and Cooper M.C. Constraints, consistency and closure. Artificial Intelligence 101 1-2 (1998) 251-265
39. P. Jégou, Decomposition of domains based on the micro-structure of finite constraint-satisfaction problems, in: AAAI, 1993, pp. 731-736
40. H.A. Kautz, B. Selman, Planning as satisfiability, in: Proceedings of the Tenth European Conference on Artificial Intelligence (ECAI'92), 1992, pp. 359-363
41. Larrosa J., Morancho E., and Niso D. On the practical use of variable elimination in constraint optimization problems: ?still-life? as a case study. Journal of Artificial Intelligence Research 23 (2005) 421-440
42. Lewis H.R. Renaming a set of clauses as a Horn set. JACM 25 1 (1978) 134-135
43. Mackworth A.K. Consistency in networks of relations. Artificial Intelligence 8 (1977) 99-118
44. Montanari U. Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences 7 (1974) 95-132
45. Rose D.J. Triangulated graphs and the elimination process. Journal of Mathematical Analysis and Applications 32 (1970) 597-609
46. In: Rossi F., van Beek P., and Walsh T. (Eds). The Handbook of Constraint Programming (2006), Elsevier (Chapter 8. Foundations of Artificial Intelligence)
47. T.J. Schaefer, The complexity of satisfiability problems, in: Proceedings 10th ACM Symposium on Theory of Computing, STOC'78, 1978, pp. 216-226
48. van Beek P. Reasoning about qualitative temporal information. Artificial Intelligence 58 (1992) 297-326
49. van Beek P., and Dechter R. On the minimality and decomposability of row-convex constraint networks. Journal of the ACM 42 (1995) 543-561
50. M.R.C. van Dongen, From local closure properties to a global closure property, Personal communication, 2002. The source of the SMP example