| 2008 |
|---|
| 32 | EE | Marco Benedetti,
Arnaud Lallouet,
Jérémie Vautard:
Quantified Constraint Optimization.
CP 2008: 463-477 |
| 31 | EE | Sylvain Jubertie,
Emmanuel Melin,
Jérémie Vautard,
Arnaud Lallouet:
Mapping Heterogeneous Distributed Applications on Clusters.
Euro-Par 2008: 192-201 |
| 30 | EE | Marco Benedetti,
Arnaud Lallouet,
Jérémie Vautard:
Modeling adversary scheduling with QCSP+.
SAC 2008: 151-155 |
| 2007 |
|---|
| 29 | EE | Marco Benedetti,
Arnaud Lallouet,
Jérémie Vautard:
QCSP Made Practical by Virtue of Restricted Quantification.
IJCAI 2007: 38-43 |
| 28 | EE | Arnaud Lallouet,
Andrei Legtchenko:
Building Consistencies for Partially Defined Constraints with Decision Trees and Neural Networks.
International Journal on Artificial Intelligence Tools 16(4): 683-706 (2007) |
| 2006 |
|---|
| 27 | EE | Marco Benedetti,
Arnaud Lallouet,
Jérémie Vautard:
Reusing CSP Propagators for QCSPs.
CSCLP 2006: 63-77 |
| 26 | EE | Arnaud Lallouet,
Andrei Legtchenko:
From satisfiability to consistency through certificates: application to partially defined constraints.
SAC 2006: 415-416 |
| 25 | EE | Arnaud Lallouet,
Andrei Legtchenko:
Partially defined constraints in constraint-based design.
AI EDAM 20(4): 297-311 (2006) |
| 2005 |
|---|
| 24 | | Andrei Legtchenko,
Arnaud Lallouet:
Acquisition des contraintes ouvertes par apprentissage de solveurs.
CAP 2005: 185-200 |
| 23 | EE | Andrei Legtchenko,
Arnaud Lallouet:
Consistency for Partially Defined Constraints.
CP 2005: 854 |
| 22 | EE | Arnaud Lallouet,
Andrei Legtchenko:
Two Contributions of Constraint Programming to Machine Learning.
ECML 2005: 617-624 |
| 21 | EE | Arnaud Lallouet,
Andrei Legtchenko:
Consistency for Partially Defined Constraints.
ICTAI 2005: 118-125 |
| 2004 |
|---|
| 20 | EE | Arnaud Lallouet:
A Note on Bilattices and Open Constraint Programming.
CSCLP 2004: 12-25 |
| 19 | | Andrei Legtchenko,
Arnaud Lallouet,
AbdelAli Ed-Dbali:
Intermediate Consistencies by Delaying Expensive Propagators.
FLAIRS Conference 2004 |
| 18 | | Gérard Ferrand,
Arnaud Lallouet:
Une représentation déclarative des consistances de CSPs.
JFPLC 2004 |
| 2003 |
|---|
| 17 | EE | Arnaud Lallouet,
Andrei Legtchenko,
Thi-Bich-Hanh Dao,
AbdelAli Ed-Dbali:
Intermediate (Learned) Consistencies.
CP 2003: 889-893 |
| 16 | EE | Arnaud Lallouet,
Andrei Legtchenko,
Thi-Bich-Hanh Dao,
AbdelAli Ed-Dbali:
Learning Approximate Consistencies.
CSCLP 2003: 87-106 |
| 15 | | Arnaud Lallouet,
Thi-Bich-Hanh Dao,
AbdelAli Ed-Dbali:
Language, Definition and Optimal Computation of CSP Approximations.
FLAIRS Conference 2003: 182-186 |
| 14 | | Arnaud Lallouet,
Thi-Bich-Hanh Dao,
Andrei Legtchenko,
AbdelAli Ed-Dbali:
Finite Domain Constraint Solver Learning.
IJCAI 2003: 1379-1380 |
| 13 | | Arnaud Lallouet,
Andrei Legtchenko,
Thi-Bich-Hanh Dao,
AbdelAli Ed-Dbali:
Apprentissage de solveurs de contraintes sur les domaines finis.
JFPLC 2003: 125-138 |
| 12 | 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 |
|---|
| 11 | EE | Thi-Bich-Hanh Dao,
Arnaud Lallouet,
Andrei Legtchenko,
Lionel Martin:
Indexical-Based Solver Learning.
CP 2002: 541-555 |
| 10 | EE | Gérard Ferrand,
Arnaud Lallouet:
A Logic Program Characterization of Domain Reduction Approximations in Finite Domain CSPs.
ICLP 2002: 478-479 |
| 9 | | Julien Arsouze,
Gérard Ferrand,
Arnaud Lallouet:
Arbre d'itérations chaotiques pour décrire la résolution des CSP.
JFPLC 2002: 289- |
| 2000 |
|---|
| 8 | | Julien Arsouze,
Gérard Ferrand,
Arnaud Lallouet:
Une sémantique co-inductive pour la propagation de contraintes et de labeling.
JFPLC 2000: 17-32 |
| 1999 |
|---|
| 7 | | Arnaud Lallouet,
Gaétan Hains:
Programmation par contraintes parallèle: l'approche CLP(Chi).
JFPLC 1999: 107-122 |
| 1998 |
|---|
| 6 | | Arnaud Lallouet:
Semantics of a Data-Parallel Logic Language using the BSP Execution Model.
APPIA-GULP-PRODE 1998: 1-14 |
| 1997 |
|---|
| 5 | | Arnaud Lallouet:
DP-LOG: un langage logique data-parallèle.
JFPLC 1997: 53- |
| 1996 |
|---|
| 4 | | Arnaud Lallouet:
Une notion de composant logiciel en programmation logique.
JFPLC 1996: 83-98 |
| 1995 |
|---|
| 3 | | Gérard Ferrand,
Arnaud Lallouet:
A Compositional Proof Method of Partial Correctness for Normal Logic Programs.
ILPS 1995: 209-223 |
| 2 | | Arnaud Lallouet:
Preuves compositionnelles en programmation logique.
JFPLC 1995: 143-156 |
| 1994 |
|---|
| 1 | | Arnaud Lallouet:
Une sémantique inductive à la Herbrand pour la programmation logique contextuelle. Application à une notion de correction partielle.
JFPLC 1994: 61-76 |
