Tractable disjunctive constraints

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

Volumn 1330, Issue , 1997, Pages 478-490

  Cohen, David ^a   Jeavons, Peter ^a   Koubarakis, Manolis ^b  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

Complexity; Constraint satisfaction problem; NP completeness

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

COMBINATORIAL SEARCH; COMPLEXITY; CONSTRAINT CLASS; CONSTRAINT TYPES; DISJUNCTIVE CONSTRAINTS; NP COMPLETE; NP-COMPLETENESS; TRACTABLE CLASS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84948945661     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0017461     Document Type: Conference Paper

References (27)

1. Cooper, M.C., Cohen, D.A., Jeavons, P.G., "Characterizing tractable constraints," Artificial Intelligence 65, (1994), pp. 347-361.
2. Cooper, M.C., & Jeavons, P.G., "Tractable constraints on ordered domains," Artificial Intelligence 79, (1995), pp. 327-339.
3. Dechter, R., fc Pearl, J., "Structure identification in relational data," Artificial Intelligence 58 (1992) pp. 237-270.
4. Dechter, R., Pearl J. "Network-based heuristics for constraint-satisfaction problems," Artificial Intelligence 34 (1988), pp. 1-38.
5. Freuder, E.C., "A sufficient condition for backtrack-bounded search," Journal of the ACM 32 (1985) pp. 755-761.
6. Garey, M.R., & Johnson, D.S., Computers and intractability: a guide to NP-completeness, Freeman, San Francisco, California, (1979).
7. Gyssens, M., Jeavons, P., Cohen, D., "Decomposing constraint satisfaction problems using database techniques," Artificial Intelligence 66, (1994), pp. 57-89.
8. Jackson, T.H., Number Theory, Routledge and Kegan Paid, (1975).
9. Jeavons, P., Cohen D., Gyssens, M., "A unifying framework for tractable constraints," In Proceedings 1st International Conference on Principles and Practice of Constraint Programming-CP '95 (Cassis, France, September 1995), Lecture Notes in Computer Science, 976, Springer-Verlag, Berlin/New York, 1995, pp. 276-291.
10. Jonsson, P. and Bäckström, C., "A Linear Programming Approach to Temporal Reasoning," Proceedings of AAAI-96, (1996).
11. Khachian, L.G., "A polynomial time algorithm for linear programming," Soviet Math. Dokl. 20, (1979) pp. 191-194.
12. Kirousis, L., "Fast parallel constraint satisfaction," Artificial Intelligence 64, (1993), pp. 147-160.
13. Koubarakis, M., "Dense Time and Temporal Constraints with ψ", In Principles of Knowledge Representation and Reasoning: Proceedings of the Third International Conference (KR'92), (Ed. B. Nebel, C. Rich and W. Swartout), Morgan Kaufmann, San Mateo, CA, (1992), pp. 24-35.
14. Koubarakis, M., "From Local to Global Consistency in Temporal Constraint Networks," In Proceedings 1st International Conference on Principles and Practice of Constraint Programming-CP '95 (Cassis, France, September 1995), Lecture Notes in Computer Science, 976, Springer-Verlag, Berlin/New York, (1995), pp. 53-69.
15. Koubarakis, M., "Tractable Disjunctions of Linear Constraints," In Proceedings of the 2nd International Conference on Principles and Practice of Constraint Programming-CP '96 (Boston, MA, August 1996), Lecture Notes in Computer Science, 1118, Springer-Verlag, Berlin/New York, (1996), pp. 297-307.
16. Ladkin, P.B., & Maddux, R.D., "On binary constraint problems," Journal of the ACM 41 (1994), pp. 435-469.
17. Lassez, J-L., and McAloon, K., "A Canonical Form for Generalized Linear Constraints," Technical Report RC15004 (#67009), IBM Research Division, T.J. Watson Research Center, (1989).
18. Lassez, J-L., and McAloon, K., "A Canonical Form for Generalized Linear Constraints," Lecture Notes in Computer Science, 351, Springer-Verlag, Berlin/New York, (1989), pp. 19-27.
19. Mackworth, A.K. "Consistency in networks of relations," Artificial Intelligence 8 (1977) pp. 99-118.
20. Montanari, U., "Networks of constraints: fundamental properties and applications to picture processing," Information Sciences 7 (1974), pp. 95-132.
21. Montanari, U., fc Rossi, F., "Constraint relaxation may be perfect," Artificial Intelligence 48 (1991), pp. 143-170.
22. Nebel, B. & Burckert, H-J., "Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra," Journal of the ACM, (1995), pp. 43-66.
23. Schaefer, T.J., "The complexity of satisfiability problems," Proc 10th ACM Symposium on Theory of Computing (STOC) , (1978) pp. 216-226.
24. Tsang, E., Foundations of Constraint Satisfaction, Academic Press, (1993).
25. van Beek, P., "On the Minimality and Decomposability of Row-Convex Constraint Networks," Proceedings of the Tenth National Conference on Artificial Intelligence, AAAI-92, MIT Press, (1992) pp. 447-452.
26. Van Hentenryck, P., Deville, Y., Teng, C-M., "A generic arc-consistency algorithm and its specializations," Artificial Intelligence 57 (1992), pp. 291-321.
27. Vilain, M., Kautz, H., van Beek, P., "Constraint Propagation Algorithms for Temporal Reasoning: A Revised Report," In Readings in Qualitative Reasoning about Physical Systems, Ed. Weld, D.S. and de Kleer, J., Morgan Kaufmarm, (1989), pp. 373-381.