2008 |
18 | EE | Khalil Djelloul,
Thi-Bich-Hanh Dao,
Thom W. Frühwirth:
Theory of finite or infinite trees revisited.
TPLP 8(4): 431-489 (2008) |
2007 |
17 | EE | Khalil Djelloul,
Thi-Bich-Hanh Dao,
Thom W. Frühwirth:
Toward a first-order extension of Prolog's unification using CHR: a CHR first-order constraint solver over finite or infinite trees.
SAC 2007: 58-64 |
16 | EE | Khalil Djelloul,
Thi-Bich-Hanh Dao,
Thom W. Frühwirth:
Theory of Finite or Infinite Trees Revisited
CoRR abs/0706.4323: (2007) |
2006 |
15 | EE | Khalil Djelloul,
Thi-Bich-Hanh Dao:
Extension of First-Order Theories into Trees.
AISC 2006: 53-67 |
14 | EE | Thi-Bich-Hanh Dao,
Khalil Djelloul:
Solving First-Order Constraints in the Theory of the Evaluated Trees.
CSCLP 2006: 108-123 |
13 | EE | Thi-Bich-Hanh Dao,
Khalil Djelloul:
Solving First-Order Constraints in the Theory of the Evaluated Trees.
ICLP 2006: 423-424 |
12 | EE | Khalil Djelloul,
Thi-Bich-Hanh Dao:
Solving first-order constraints in the theory of finite or infinite trees: introduction to the decomposable theories.
SAC 2006: 7-14 |
11 | EE | Khalil Djelloul,
Thi-Bich-Hanh Dao:
Complete First-Order Axiomatization of Finite or Infinite M-extended Trees.
WLP 2006: 111-119 |
2003 |
10 | EE | Arnaud Lallouet,
Andrei Legtchenko,
Thi-Bich-Hanh Dao,
AbdelAli Ed-Dbali:
Intermediate (Learned) Consistencies.
CP 2003: 889-893 |
9 | EE | Arnaud Lallouet,
Andrei Legtchenko,
Thi-Bich-Hanh Dao,
AbdelAli Ed-Dbali:
Learning Approximate Consistencies.
CSCLP 2003: 87-106 |
8 | | Arnaud Lallouet,
Thi-Bich-Hanh Dao,
AbdelAli Ed-Dbali:
Language, Definition and Optimal Computation of CSP Approximations.
FLAIRS Conference 2003: 182-186 |
7 | | Arnaud Lallouet,
Thi-Bich-Hanh Dao,
Andrei Legtchenko,
AbdelAli Ed-Dbali:
Finite Domain Constraint Solver Learning.
IJCAI 2003: 1379-1380 |
6 | | Arnaud Lallouet,
Andrei Legtchenko,
Thi-Bich-Hanh Dao,
AbdelAli Ed-Dbali:
Apprentissage de solveurs de contraintes sur les domaines finis.
JFPLC 2003: 125-138 |
5 | EE | Alain Colmerauer,
Thi-Bich-Hanh Dao:
Expressiveness of Full First-Order Constraints in the Algebra of Finite or Infinite Trees.
Constraints 8(3): 283-302 (2003) |
4 | EE | AbdelAli Ed-Dbali,
Thi-Bich-Hanh Dao,
Arnaud Lallouet,
Andrei Legtchenko:
Apprentissage de solveurs de contraintes sur les domaines finis.
Technique et Science Informatiques 22(1): 125-138 (2003) |
2002 |
3 | EE | Thi-Bich-Hanh Dao,
Arnaud Lallouet,
Andrei Legtchenko,
Lionel Martin:
Indexical-Based Solver Learning.
CP 2002: 541-555 |
2000 |
2 | EE | Alain Colmerauer,
Thi-Bich-Hanh Dao:
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees.
CP 2000: 172-186 |
1 | | Thi-Bich-Hanh Dao:
Résolution de contraintes du premier ordre dans la théorie des arbres finis ou infinis.
JFPLC 2000: 225-240 |