Reformulating table constraints using functional dependencies-an application to explanation generation

Constraints

Volumn 13, Issue 3, 2008, Pages 385-406

  Cambazard, Hadrien ^a   O'Sullivan, Barry ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

Explanation generation; Functional dependencies; Table constraints

Indexed keywords

BUSINESS MEDIA; CONSTRAINT MODELLING; DATABASE DESIGNS; FUNCTIONAL DEPENDENCIES (FD); NOVE L APPROACH; REAL-WORLD DATASETS; SPRINGER (CO);

EID: 47249087306     PISSN: 13837133     EISSN: 15729354     Source Type: Journal    
DOI: 10.1007/s10601-008-9042-3     Document Type: Article

References (21)

1. Amilhastre, J., Fargier, H., & Marguis, P. (2002). Consistency restoration and explanations in dynamic CSPs - application to configuration. Artificial Intelligence, 135,199-234.
2. Bailey, J., & Stuckey, P. J. 2005. Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization. In Proceedings of PADL (pp. 174-186).
3. Beeri, C., Dowd, M., Fagin, R., & Statman, R. (1984). On the structure of armstrong relations for functional dependencies. Journal of the ACM, 31(1), 30-46.
4. Beeri, C., Fagin, R., & Howard, J. H. (1977). A complete axiomatization for functional and multivalued dependencies in database relations. In D. C. P. Smith (Ed.), SIGMOD Conference (pp. 47-61). ACM.
5. Bessière, C., & Régin, J.-C. (1997). Arc consistency for general constraint networks: Preliminary results. In IJCAI (Vol. 1, pp. 398-404).
6. de Kleer, J., & Williams, B. C. (1987). Diagnosing multiple faults. Artificial Intelligence, 32(1), 97-130.
7. Doyle, J. (1979). A truth maintenance system. Artificial Intelligence, 12, 231-272.
8. Freuder, E. C. (1996). In pursuit of the holy grail. ACM Computing Surveys, 28(4), 63.
9. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. Series of books in the mathematical sciences. New York: W.H.Freeman.
10. Gyssens, M., Jeavons, P., & Cohen, D. A. (1994). Decomposing constraint satisfaction problems using database techniques. Artificial Intelligence, 66(1), 57-89.
11. Huhtala, Y., Kärkkäinen, J., Porkka, P., Toivonen, H. (1999). Tane: An efficient algorithm for discovering functional and approximate dependencies. Computer journalen, 42(2), 100-111.
12. Junker, U. (2004). QuickXplain: Preferred explanations and relaxations for over-constrained problems. In AAAI (pp. 167-172).
13. Jussien, N. (2003). The versatility of using explanations within constraint programming. Research Report 03-04-INFO. Nantes, France: École des Mines de Nantes.
14. Leake, D. B., & Sooriamurthi, R. (2001). When two case bases are better than one: Exploiting multiple case bases. In D. W. Aha, & I. Watson (Eds.), ICCBR. Lecture notes in computer science (Vol. 2080, pp. 321-335). New York: Springer.
15. Lecoutre, C., & Szymanek, R. (2006). Generalized arc consistency for positive table constraints. In F. Benhamou (Ed.), CP. Lecture notes in computer science (Vol. 4204, pp. 284-298). New York: Springer.
16. Lhomme, O., & Régin, J.-C. (2005). A fast arc consistency algorithm for n-ary constraints. In M. M. Veloso, & S. Kambhampati (Eds.), AAAI (pp. 405-410). Menlo Park: AAAI Press / The MIT Press.
17. Liffiton, M. H., & Sakallahm, K. A. (2005). On finding all minimally unsatisfiable subformulas. In SAT (pp. 173-186).
18. Régin, J.-C. (1994). A filtering algorithm for constraints of difference in CSPs. In AAAI (pp. 362-367).
19. Reilly, J., Zhang, J., McGinty, L., Pu, P., & Smyth, B. (2007). Evaluating compound critiquing recommenders: A real-user study. In ACM Conference on electronic commerce (pp. 114-123).
20. Reiter, R. (1987). A theory of diagnosis from first principles. Artificial Intelligence, 32(1), 57-95.
21. Wallace, M. (1996). Practical applications of constraint programming. Constraints, 1(1/2), 139-168.