default search action
Arnaud Lallouet
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c43]Guillaume Perez, Steve Malalel, Gael Glorian
, Victor Jung, Alexandre Papadopoulos, Marie Pelleau, Wijnand Suijlen, Jean-Charles Régin, Arnaud Lallouet:
Generalized Confidence Constraints. AAAI 2023: 4078-4086 - [c42]Guillaume Perez, Gaël Glorian, Wijnand Suijlen, Arnaud Lallouet:
Distribution Optimization in Constraint Programming. CP 2023: 29:1-29:19 - [c41]Guillaume Perez, Gaël Glorian
A Constraint Programming Model for Scheduling the Unloading of Trains in Ports. ICTAI 2023: 693-699 - [i3]Guillaume Perez, Gael Glorian
A Constraint Programming Model for Scheduling the Unloading of Trains in Ports: Extended. CoRR abs/2312.13682 (2023) - 2022
- [j7]Arnaud Lallouet:
New AI Techniques for Combinatorial Optimization. Int. J. Artif. Intell. Tools 31(3): 2241001:1-2241001:7 (2022) - [c40]Wijnand Suijlen
A Parallel Algorithm for GAC Filtering of the Alldifferent Constraint. CPAIOR 2022: 390-407 - [c39]Thomas Fournier, Arnaud Lallouet, Télio Cropsal, Gaël Glorian
A Deep Reinforcement Learning Heuristic for SAT based on Antagonist Graph Neural Networks. ICTAI 2022: 1218-1222 - 2021
- [i2]Guillaume Perez, Sebastian Ament, Carla P. Gomes, Arnaud Lallouet:
Constrained Machine Learning: The Bagel Framework. CoRR abs/2112.01088 (2021) - 2020
- [p1]Arnaud Lallouet, Yves Moinard, Pascal Nicolas, Igor Stéphan:
Logic Programming. A Guided Tour of Artificial Intelligence Research (2) (II) 2020: 83-113
2010 – 2019
- 2019
- [j6]Anthony Palmieri, Arnaud Lallouet
Constraint Games for stable and optimal allocation of demands in SDN. Constraints An Int. J. 24(3-4): 252-287 (2019) - [j5]Kahina Bouchama, Arnaud Lallouet, Mohammed Said Radjef
Solving a Potential Clustering Game. Int. J. Artif. Intell. Tools 28(2): 1950006:1-1950006:26 (2019) - [c38]Anthony Palmieri, Arnaud Lallouet, Luc Pons:
Constraint Games for Stable and Optimal Allocation of Demands in SDN. IJCAI 2019: 6216-6220 - 2017
- [c37]Anthony Palmieri, Arnaud Lallouet:
Constraint Games revisited. IJCAI 2017: 729-735 - 2015
- [j4]Arnaud Lallouet, Jimmy Ho-Man Lee, Terrence W. K. Mak
Ultra-weak solutions and consistency enforcement in minimax weighted constraint satisfaction. Constraints An Int. J. 20(2): 109-154 (2015) - 2014
- [c36]Thi-Van-Anh Nguyen, Arnaud Lallouet:
A Complete Solver for Constraint Games. CP 2014: 58-74 - [i1]Thi-Van-Anh Nguyen, Arnaud Lallouet:
A Complete Solver for Constraint Games. CoRR abs/1404.4502 (2014) - 2013
- [c35]Thi-Van-Anh Nguyen, Arnaud Lallouet, Lucas Bordeaux:
Constraint Games: Framework and Local Search Solver. ICTAI 2013: 963-970 - 2012
- [c34]Arnaud Lallouet, Jimmy Ho-Man Lee, Terrence W. K. Mak
Consistencies for Ultra-Weak Solutions in Minimax Weighted CSPs Using the Duality Principle. CP 2012: 373-389 - 2011
- [c33]Arnaud Lallouet, Yat Chiu Law, Jimmy Ho-Man Lee, Charles F. K. Siu:
Constraint Programming on Infinite Data Streams. IJCAI 2011: 597-604 - 2010
- [c32]Arnaud Lallouet, Matthieu Lopez, Lionel Martin, Christel Vrain:
On Learning Constraint Problems. ICTAI (1) 2010: 45-52 - [c31]Jérémie Vautard, Arnaud Lallouet, Youssef Hamadi:
A Parallel Solving Algorithm for Quantified Constraints Problems. ICTAI (1) 2010: 271-274
2000 – 2009
- 2008
- [c30]Marco Benedetti, Arnaud Lallouet, Jérémie Vautard:
Quantified Constraint Optimization. CP 2008: 463-477 - [c29]Sylvain Jubertie, Emmanuel Melin, Jérémie Vautard, Arnaud Lallouet:
Mapping Heterogeneous Distributed Applications on Clusters. Euro-Par 2008: 192-201 - [c28]Marco Benedetti, Arnaud Lallouet, Jérémie Vautard:
Modeling adversary scheduling with QCSP+. SAC 2008: 151-155 - 2007
- [j3]Arnaud Lallouet, Andrei Legtchenko:
Building Consistencies for Partially Defined Constraints with Decision Trees and Neural Networks. Int. J. Artif. Intell. Tools 16(4): 683-706 (2007) - [c27]Marco Benedetti, Arnaud Lallouet, Jérémie Vautard:
QCSP Made Practical by Virtue of Restricted Quantification. IJCAI 2007: 38-43 - 2006
- [j2]Arnaud Lallouet, Andrei Legtchenko:
Partially defined constraints in constraint-based design. Artif. Intell. Eng. Des. Anal. Manuf. 20(4): 297-311 (2006) - [c26]Marco Benedetti, Arnaud Lallouet, Jérémie Vautard:
Reusing CSP Propagators for QCSPs. CSCLP 2006: 63-77 - [c25]Arnaud Lallouet, Jérémie Vautard:
Auralization of a Constraint Solver: The music of n-queens. ICMC 2006 - [c24]Arnaud Lallouet, Andrei Legtchenko:
From satisfiability to consistency through certificates: application to partially defined constraints. SAC 2006: 415-416 - 2005
- [c23]Andrei Legtchenko, Arnaud Lallouet:
Acquisition des contraintes ouvertes par apprentissage de solveurs. CAP 2005: 185-200 - [c22]Andrei Legtchenko, Arnaud Lallouet:
Consistency for Partially Defined Constraints. CP 2005: 854 - [c21]Arnaud Lallouet, Andrei Legtchenko:
Two Contributions of Constraint Programming to Machine Learning. ECML 2005: 617-624 - [c20]Arnaud Lallouet, Andrei Legtchenko:
Consistency for Partially Defined Constraints. ICTAI 2005: 118-125 - 2004
- [c19]Arnaud Lallouet:
A Note on Bilattices and Open Constraint Programming. CSCLP 2004: 12-25 - [c18]Andrei Legtchenko, Arnaud Lallouet, AbdelAli Ed-Dbali:
Intermediate Consistencies by Delaying Expensive Propagators. FLAIRS 2004: 275-280 - [c17]Gérard Ferrand, Arnaud Lallouet:
Une représentation déclarative des consistances de CSPs. JFPLC 2004 - 2003
- [j1]AbdelAli Ed-Dbali, Thi-Bich-Hanh Dao, Arnaud Lallouet, Andrei Legtchenko:
Apprentissage de solveurs de contraintes sur les domaines finis. Tech. Sci. Informatiques 22(1): 125-138 (2003) - [c16]Arnaud Lallouet, Andrei Legtchenko, Thi-Bich-Hanh Dao, AbdelAli Ed-Dbali:
Intermediate (Learned) Consistencies. CP 2003: 889-893 - [c15]Arnaud Lallouet, Andrei Legtchenko, Thi-Bich-Hanh Dao, AbdelAli Ed-Dbali:
Learning Approximate Consistencies. CSCLP 2003: 87-106 - [c14]Arnaud Lallouet, Thi-Bich-Hanh Dao, AbdelAli Ed-Dbali:
Language, Definition and Optimal Computation of CSP Approximations. FLAIRS 2003: 182-186 - [c13]Arnaud Lallouet, Thi-Bich-Hanh Dao, Andrei Legtchenko, AbdelAli Ed-Dbali:
Finite Domain Constraint Solver Learning. IJCAI 2003: 1379-1380 - [c12]Arnaud Lallouet, Andrei Legtchenko, Thi-Bich-Hanh Dao, AbdelAli Ed-Dbali:
Apprentissage de solveurs de contraintes sur les domaines finis. JFPLC 2003: 125-138 - 2002
- [c11]Thi-Bich-Hanh Dao, Arnaud Lallouet, Andrei Legtchenko, Lionel Martin:
Indexical-Based Solver Learning. CP 2002: 541-555 - [c10]Gérard Ferrand, Arnaud Lallouet:
A Logic Program Characterization of Domain Reduction Approximations in Finite Domain CSPs. ICLP 2002: 478-479 - [c9]Julien Arsouze, Gérard Ferrand, Arnaud Lallouet:
Arbre d'itérations chaotiques pour décrire la résolution des CSP. JFPLC 2002: 289- - 2000
- [c8]Julien Arsouze, Gérard Ferrand, Arnaud Lallouet:
Une sémantique co-inductive pour la propagation de contraintes et de labeling. JFPLC 2000: 17-32
1990 – 1999
- 1999
- [c7]Arnaud Lallouet, Gaétan Hains:
Programmation par contraintes parallèle: l'approche CLP(Chi). JFPLC 1999: 107-122 - 1998
- [c6]Arnaud Lallouet:
Semantics of a Data-Parallel Logic Language using the BSP Execution Model. APPIA-GULP-PRODE 1998: 1-14 - 1997
- [c5]Arnaud Lallouet:
DP-LOG: un langage logique data-parallèle. JFPLC 1997: 53- - 1996
- [c4]Arnaud Lallouet:
Une notion de composant logiciel en programmation logique. JFPLC 1996: 83-98 - 1995
- [c3]Arnaud Lallouet:
Preuves compositionnelles en programmation logique. JFPLC 1995: 143-156 - [c2]Gérard Ferrand, Arnaud Lallouet:
A Compositional Proof Method of Partial Correctness for Normal Logic Programs. ILPS 1995: 209-223 - 1994
- [c1]Arnaud Lallouet:
Une sémantique inductive à la Herbrand pour la programmation logique contextuelle. Application à une notion de correction partielle. JFPLC 1994: 61-76
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-07 22:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: