Thi-Bich-Hanh Dao

Research topics

Publications

International Journal Articles

  1. Thi-Bich-Hanh Dao, Khanh-Chuong Duong, Christel Vrain, Constrained Clustering by Constraint Programming. Artificial Intelligence Journal, Combining Constraint Solving with Mining and Learning, Vol 244, pages 70-94, Elsevier, DOI 10.1016/j.artint.2015.05.006, pdf, 2017.
  2. Denys Duchier, Thi-Bich-Hanh Dao, Yannick Parmentier. Model-Theory and Implementation of Property Grammars with Features. Journal of Logic and Computation, 24 (2), pages 491-509, 2014.
  3. Khalil Djelloul, Thi-Bich-Hanh Dao, Thom Fruehwirth. Theory of Finite or Infinite Trees Revisited. Journal of Theory and Practice of Logic Programming 8 (4), pages 431-489, 2008.
  4. Alain Colmerauer and Thi-Bich-Hanh Dao. Expressiveness of Full First-Order Constraints in the Algebra of Finite or Infinite Trees. Journal of Constraints 8(3), Kluwer Academic Publishers, pages 283-302, 2003.

National Journal Articles

  1. Thi-Bich-Hanh Dao, Khanh-Chuong Duong, Christel Vrain, Un nouveau modèle pour la classification non supervisée sous contraintes. Revue d'Intelligence Artificielle.28/5, pages 523-545, 2014.
  2. AbdelAli Ed-Dbali, Thi-Bich-Hanh Dao, Arnaud Lallouet, Andrei Legtchenko. Apprentissage de solveur contraintes sur les domaines finis. Technique et Science Informatique 22 (1), pages 125-138, 2003.

International Conference Papers

  1. Chia-Tung Kuo, S. S. Ravi, Thi-Bich-Hanh Dao, Christel Vrain, Ian Davidson. A Framework for Minimal Clustering Modification via Constraint Programming. In the 31st AAAI Conference on Artificial Intelligence AAAI-17, 2017.
  2. Thi-Bich-Hanh Dao, Christel Vrain, Khanh-Chuong Duong, Ian Davidson. A Framework for Actionable Clustering Using Constraint Programming. In the 22nd European Conference on Artificial Intelligence ECAI, pages 453-461, 2016.
  3. Tias Guns, Thi-Bich-Hanh Dao, Christel Vrain, Khanh-Chuong Duong. Repetitive Branch-and-Bound Using Constraint Programming for Constrained Minimum Sum-of-Squares Clustering. In the 22nd European Conference on Artificial Intelligence ECAI, pages 462-470, 2016.
  4. Thi-Bich-Hanh Dao, Khanh-Chuong Duong, Christel Vrain. Constrained Minimum Sum of Squares Clustering by Constraint Programming. In 21st International Conference on Principles and Practice of Constraint Programming (CP 2015), 2015.
  5. Thi-Bich-Hanh Dao, Khanh-Chuong Duong, Christel Vrain. A Delarative Framework for Constrained Clustering. In European Conference on Machine Learning and Principles and Pratice of Knowledge Discovery in Databases ECMLPKDD, pages 419-434, 2013.
  6. Thi-Bich-Hanh Dao, Khanh-Chuong Duong, Christel Vrain. A Filtering Algorithm for Constrained Clustering with Within-Cluster Sum of Dissimilarities Criterion. In IEEE International Conference on Tools with Artificial Intelligence ICTAI 2013, pages 1060-1067, 2013.
  7. Yohan Boichut, Thi-Bich-Hanh Dao, Valérie Murat. Characterizing Conclusive Approximations by Logical Formulae. In RV 2011, pages 72-84, 2011.
  8. Denys Duchier, Thi-Bich-Hanh Dao, Yannick Parmentier. Model-Theory of Property Grammars with Features. In IWPT 2011, pages 75-79, 2011.
  9. Denys Duchier, Thi-Bich-Hanh Dao, Yannick Parmentier, Willy Lesaint. Property Grammars Parsing Seen as a Constraint Optimization Problem. In Proc. of the International Conference on Formal Grammar FG 2010. Revised Selected Papers, LNCS 7395, pages 82-96, 2010.
  10. Denys Duchier, Jean-Philippe Prost, Thi-Bich-Hanh Dao. A model-theoretic framework for grammaticality judgements. In Conference on Formal Grammar (FG2009). Revised Selected Papers, LNCS 5591, pages 17-30, 2009.
  11. Khalil Djelloul and Thi-Bich-Hanh Dao and Thom Fruehwirth. Toward a first-order extension of Prolog's unification using CHR. In ACM Symposium on applied computing SAC 2007, pages 58-64, 2007.
  12. Thi-Bich-Hanh Dao, Khalil Djelloul. Solving First-Order Constraints in the Theory of the Evaluated Trees. In Recent Advance in constraints. Lecture notes in computer science. Selected revised paper CSCLP 2006, pages 108-123, 2006.
  13. Thi-Bich-Hanh Dao and Khalil Djelloul. Solving First-Order Constraints in the Theory of the Evaluated Trees. In Logic Programming, 22nd International Conference, ICLP 2006, Proceedings. Lecture Notes in Computer Science 4079, pages 423-424, 2006.
  14. Khalil Djelloul and Thi-Bich-Hanh Dao. Solving first-order constraints in the theory of finite or infinite trees: introduction to the decomposable theories. In Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), pages 7-14, 2006.
  15. Khalil Djelloul and Thi-Bich-Hanh Dao. Extension into trees of first order theories. In The 8th International conference on Artificial Intelligence and Symbolic Computation AISC, Lecture Notes in Artificial Intelligence , pages 53-67, 2006.
  16. Arnaud Lallouet, Andrei Legtchenko, Thi-Bich-Hanh Dao, Abdelali Ed-Dbali. Intermediate (Learned) Consistencies. In International Conference on Principles and Practice of Constraint Programming CP 2003, pages 889-893, 2003.
  17. Arnaud Lallouet, Andrei Legtchenko, Thi-Bich-Hanh Dao, Abdelali Ed-Dbali. Learning Approximate Consistencies. In Recent Advances in Constraints Joint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2003. Selected Papers, pages 87-106, 2003.
  18. Arnaud Lallouet and Thi-Bich-Hanh Dao and Abdelali Ed-Dbali. Language, Definition and Optimal Computation of CSP Approximations. In Proceedings of the Sixteenth International Florida Artificial Intelligence Research Society Conference FLAIRS, AAAI Press 2003, pages 182-186, 2003.
  19. Arnaud Lallouet and Thi-Bich-Hanh Dao and Andrei Legtchenko and Abdelali Ed-Dbali. Finite Domain Constraint Solver Learning. In IJCAI-03, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, 2003 pages 1379-1380, 2003.
  20. Thi-Bich-Hanh Dao and Arnaud Lallouet and Andrei Legtchenko and Lionel Martin. Indexical-Based Solver Learning. In Principles and Practice of Constraint Programming 8th International Conference, CP 2002, pages 541-555, 2002.
  21. Alain Colmerauer, Thi-Bich-Hanh Dao. Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees. In Principles and Practice of Constraint Programming - CP 2000, pages 172-186, 2000.

National Conference Papers

  1. Thi-Bich-Hanh Dao, Khanh-Chuong Duong, Tias Guns, Christel Vrain. Branch-and-bound répétitif et programmation par contraintes pour le clustering sous contraintes. In Douzième Journées Francophones de Programmation par Contraintes (JFPC 2016)
  2. Thi-Bich-Hanh Dao, Khanh-Chuong Duong,Christel Vrain. Clustering avec la minimisation de la somme des carrés par la programmation par contraintes. In Onzièmes Journées Francophones de Programmation par Contraintes (JFPC 2015)
  3. Thi-Bich-Hanh Dao, Willy Lesaint, Christel Vrain. Clustering conceptuel et relationnel en programmation par contraintes. In Onzièmes Journées Francophones de Programmation par Contraintes (JFPC 2015)
  4. Thi-Bich-Hanh Dao, Khanh-Chuong Duong, Christel Vrain. Classification non supervisée mono et bi-objectif par la programmation par contraintes. In Dixièmes Journées Francophones de Programmation par Contraintes (JFPC 2014)
  5. Thi-Bich-Hanh Dao, Khanh-Chuong Duong, Christel Vrain. Un modèle général pour la classification non supervisée sous contraintes d'utilisateurs. In Neuvièmes Journées Francophones de Programmation par Contraintes (JFPC 2013)
  6. Thi-Bich-Hanh Dao, Khanh-Chuong Duong, Christel Vrain. Une approche en programmation par contraintes pour la classification non supervisée. In EGC 2013, pages 55-66.
  7. Denys Duchier, Thi-Bich-Hanh Dao, Yannick Parmentier. Analyse syntaxique par contraintes pour les grammaires de propriétés à traits. In Huitièmes Journées Francophones de Programmation par Contraintes (JFPC 2012)
  8. Denys Duchier, Thi-Bich-Hanh Dao, Yannick Parmentier and Willy Lesaint. Une modélisation en CSP des grammaires de propriétés. In Sixièmes Journées Francophones de Programmation par Contraintes (JFPC 2010)
  9. Thi Bich Hanh Dao. Un algorithme de décision dans l'algèbre des arbres finis ou infinis et des queues. In Actes des Cinquièmes Journées Francophones de Programmation par Contraintes (JFPC 2009)
  10. Khalil Djelloul and Thi-Bich-Hanh Dao and Thom Fruehwirth. Extension au premier ordre de l'unification des termes par CHR. In Troisièmes Journées Francophones de Programmationpar Contraintes (JFPC 2007)
  11. Khalil Djelloul and Thi-Bich-Hanh Dao. Complete First-Order Axiomatization of Finite or Infinite M-extended Trees. In 20th Workshop on Logic Programming, Vienna, Austria, February 22--24, 2006. INFSYS Research Report 1843-06-02 Technische Universität Wien, Austria 2006
  12. Thi-Bich-Hanh Dao and Khalil Djelloul. Résolution de contraintes du premier ordre dans la théorie des arbres évalués. In Journées Francophones de Programmation par Contraintes (JFPC 2006).
  13. Khalil Djelloul and Thi-Bich-Hanh Dao. Complétude des extensions en arbres de théories. In Journées Francophones de Programmation par Contraintes (JFPC 2006).
  14. Arnaud Lallouet, Andrei Legtchenko, Thi-Bich-Hanh Dao, Abdelali Ed-Dbali. Apprentissage de solveurs de contraintes sur les domaines finis. In Journées Francophones de Programmation en Logique avec Contraintes (JFPLC 2003). Hermes/Lavoisier 2003, ISBN 2-7462-0739-7
  15. Thi Bich Hanh Dao. Résolution de contraintes du premier ordre dans la théorie des arbres finis ou infinis. In JFPLC 2000, pages 225-240.