Reformulating Positive Table Constraints Using Functional Dependencies

1. Sillito, J., Beacham, A., Chen, X., van Beek, P.: Constraint programming lessons learned from crossword puzzles. In: 14th Canadian Conference on Artificial Intelligence, pp. 78–87 (2001)

   Google Scholar 

2. Amilhastre, J., Fargier, H., Marguis, P.: Consistency restoration and explanations in dynamic CSPs – application to configuration. Artif. Intell. 135, 199–234 (2002)

   Article  MATH  Google Scholar 

3. Beeri, C., Dowd, M., Fagin, R., Statman, R.: On the structure of armstrong relations for functional dependencies. J. ACM 31(1), 30–46 (1984)

   Article  MATH  MathSciNet  Google Scholar 

4. Bessière, C., Régin, J.-C.: Arc consistency for general constraint networks: Preliminary results. In: IJCAI, vol. (1), pp. 398–404 (1997)

   Google Scholar 

5. Cambazard, H., O’Sullivan, B.: Reformulating table constraints using functional dependencies - an application to explanation generation. Constraints 13 (2008)

   Google Scholar 

6. Carlsson, M.: Filtering for the case constraint. In: Talk given at the Advanced School on Global Constraints, Samos, Greece (2006)

   Google Scholar 

7. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in the Mathematical Sciences. W.H.Freeman, New York (1979)

   MATH  Google Scholar 

8. Gent, I.P., Jefferson, C., Miguel, I., Nightingale, P.: Data structures for generalised arc consistency for extensional constraints. In: AAAI, pp. 191–197 (2007)

   Google Scholar 

9. Gyssens, M., Jeavons, P., Cohen, D.A.: Decomposing constraint satisfaction problems using database techniques. Artif. Intell. 66(1), 57–89 (1994)

   Article  MATH  MathSciNet  Google Scholar 

10. Hubbe, P.D., Freuder, E.C.: An efficient cross product representation of the constraint satisfaction problem search space. In: AAAI, pp. 421–427 (1992)

    Google Scholar 

11. Huhtala, Y., Kärkkäinen, J., Porkka, P., Toivonen, H.: Tane: An efficient algorithm for discovering functional and approximate dependencies. Comput. J. 42(2), 100–111 (1999)

    Article  MATH  Google Scholar 

12. Katsirelos, G., Walsh, T.: A compression algorithm for large arity extensional constraints. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 379–393. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

13. Laburthe, F., Caseau, Y.: Using constraints for exploring catalogs. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 883–888. Springer, Heidelberg (2003)

    Google Scholar 

14. Leake, D.B., Sooriamurthi, R.: When two case bases are better than one: Exploiting multiple case bases. In: Aha, D.W., Watson, I. (eds.) ICCBR 2001. LNCS (LNAI), vol. 2080, pp. 321–335. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

15. Lecoutre, C., Szymanek, R.: Generalized arc consistency for positive table constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 284–298. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

16. Lhomme, O., Régin, J.-C.: A fast arc consistency algorithm for n-ary constraints. In: Veloso, M.M., Kambhampati, S. (eds.) AAAI, pp. 405–410. AAAI Press / The MIT Press, Menlo Park (2005)

    Google Scholar 

17. Pesant, G.: A Regular Language Membership Constraint for Finite Sequences of Variables. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 482–495. Springer, Heidelberg (2004)

    Google Scholar 

18. Reilly, J., Zhang, J., McGinty, L., Pu, P., Smyth, B.: Evaluating compound critiquing recommenders: a real-user study. In: ACM Conference on Electronic Commerce, pp. 114–123 (2007)

    Google Scholar 

19. Richaud, G., Cambazard, H., O’Sullivan, B., Jussien, N.: Automata for nogood recording in constraint satisfaction problems. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, Springer, Heidelberg (2006)

    Google Scholar 

20. Wallace, M.: Practical applications of constraint programming. Constraints 1(1/2), 139–168 (1996)

    Article  MathSciNet  Google Scholar 

Download references