default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristophe Lecoutre
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c64]Thibault Falque, Gilles Audemard, Christophe Lecoutre, Bertrand Mazure:
Check-In Desk Scheduling Optimisation at CDG International Airport. AAAI 2024: 22743-22751- [c63]Duc Anh Le, Stéphanie Roussel, Christophe Lecoutre, Anouck Chan:
Learning Effect and Compound Activities in High Multiplicity RCPSP: Application to Satellite Production. CP 2024: 18:1-18:25 - [c62]Thibault Falque, Christophe Lecoutre, Bertrand Mazure, Romain Wallon:
Parking Scheduling Optimisation at Paris Charles de Gaulle International Airport. ICAART (3) 2024: 1119-1126 - 2023
- [c61]Gilles Audemard, Christophe Lecoutre, Charles Prud'homme
:
Guiding Backtrack Search by Tracking Variables During Constraint Propagation. CP 2023: 9:1-9:17 - [i12]Christophe Lecoutre:
ACE, a generic constraint solver. CoRR abs/2302.05405 (2023) - [i11]Gilles Audemard, Christophe Lecoutre, Emmanuel Lonca:
Proceedings of the 2023 XCSP3 Competition. CoRR abs/2312.05877 (2023) - 2022
- [c60]Frédéric Koriche, Christophe Lecoutre, Anastasia Paparrizou, Hugues Wattez:
Best Heuristic Identification for Constraint Satisfaction. IJCAI 2022: 1859-1865 - [i10]Gilles Audemard, Christophe Lecoutre, Emmanuel Lonca:
Proceedings of the 2022 XCSP3 Competition. CoRR abs/2209.00917 (2022) - 2021
- [c59]Nicolas Szczepanski, Gilles Audemard, Laetitia Jourdan, Christophe Lecoutre, Lucien Mousin, Nadarajen Veerapen:
A hybrid CP/MOLS approach for multi-objective imbalanced classification. GECCO 2021: 723-731 - 2020
- [j15]Gilles Audemard, Frédéric Boussemart, Christophe Lecoutre, Cédric Piette, Olivier Roussel:
XCSP3 and its ecosystem. Constraints An Int. J. 25(1-2): 47-69 (2020) - [c58]Gilles Audemard, Christophe Lecoutre, Mehdi Maamar:
Segmented Tables: An Efficient Modeling Tool for Constraint Reasoning. ECAI 2020: 315-322 - [c57]Hugues Wattez, Frédéric Koriche, Christophe Lecoutre, Anastasia Paparrizou, Sébastien Tabary:
Learning Variable Ordering Heuristics with Multi-Armed Bandits and Restarts. ECAI 2020: 371-378 - [c56]Gael Glorian, Jean-Marie Lagniez, Christophe Lecoutre:
NACRE - A Nogood And Clause Reasoning Engine. LPAR 2020: 249-259 - [i9]Christophe Lecoutre, Nicolas Szczepanski:
PYCSP3: Modeling Combinatorial Constrained Problems in Python. CoRR abs/2009.00326 (2020) - [i8]Frédéric Boussemart, Christophe Lecoutre, Gilles Audemard, Cédric Piette:
XCSP3-core: A Format for Representing Constraint Satisfaction/Optimization Problems. CoRR abs/2009.00514 (2020)
2010 – 2019
- 2019
- [c55]Hélène Verhaeghe, Christophe Lecoutre, Pierre Schaus:
Extending Compact-Diagram to Basic Smart Multi-Valued Variable Diagrams. CPAIOR 2019: 581-598 - [c54]Hugues Wattez, Christophe Lecoutre, Anastasia Paparrizou, Sébastien Tabary:
Refining Constraint Weighting. ICTAI 2019: 71-77 - [i7]Christophe Lecoutre, Olivier Roussel:
Proceedings of the 2018 XCSP3 Competition. CoRR abs/1901.01830 (2019) - 2018
- [c53]Minh Thanh Khong, Christophe Lecoutre, Pierre Schaus, Yves Deville:
Soft-Regular with a Prefix-Size Violation Measure. CPAIOR 2018: 333-343 - [c52]Hélène Verhaeghe, Christophe Lecoutre, Pierre Schaus:
Compact-MDD: Efficiently Filtering (s)MDD Constraints with Reversible Sparse Bit-sets. IJCAI 2018: 1383-1389 - 2017
- [c51]Hélène Verhaeghe, Christophe Lecoutre, Pierre Schaus:
Extending Compact-Table to Negative and Short Tables. AAAI 2017: 3951-3957 - [c50]Gael Glorian, Frédéric Boussemart, Jean-Marie Lagniez, Christophe Lecoutre, Bertrand Mazure:
Combining Nogoods in Restart-Based Search. CP 2017: 129-138 - [c49]Hélène Verhaeghe, Christophe Lecoutre, Yves Deville, Pierre Schaus:
Extending Compact-Table to Basic Smart Tables. CP 2017: 297-307 - [c48]Minh Thanh Khong, Yves Deville, Pierre Schaus, Christophe Lecoutre:
Efficient Reification of Table Constraints. ICTAI 2017: 118-122 - [c47]Baudouin Le Charlier, Minh Thanh Khong, Christophe Lecoutre, Yves Deville:
Automatic Synthesis of Smart Table Constraints by Abstraction of Table Constraints. IJCAI 2017: 681-687 - 2016
- [j14]Christian Bessiere, Hélène Fargier, Christophe Lecoutre:
Computing and restoring global inverse consistency in interactive constraint satisfaction. Artif. Intell. 241: 153-169 (2016) - [c46]Jordan Demeulenaere, Renaud Hartert, Christophe Lecoutre, Guillaume Perez, Laurent Perron, Jean-Charles Régin, Pierre Schaus:
Compact-Table: Efficiently Filtering Table Constraints with Reversible Sparse Bit-Sets. CP 2016: 207-223 - [c45]Jean-Philippe Prost, Rémi Coletta, Christophe Lecoutre:
Compilation de grammaire de propriétés pour l'analyse syntaxique par optimisation de contraintes (Compilation of a Property Grammar for Syntactic Parsing through Constraint Optimisation). JEP-TALN-RECITAL (Posters) 2016: 396-402 - [i6]Jordan Demeulenaere, Renaud Hartert, Christophe Lecoutre, Guillaume Perez, Laurent Perron, Jean-Charles Régin, Pierre Schaus:
Compact-Table: Efficiently Filtering Table Constraints with Reversible Sparse Bit-Sets. CoRR abs/1604.06641 (2016) - [i5]Frédéric Boussemart, Christophe Lecoutre, Cédric Piette:
XCSP3: An Integrated Format for Benchmarking Combinatorial Constrained Problems. CoRR abs/1611.03398 (2016) - 2015
- [j13]Christophe Lecoutre, Chavalit Likitvivatanavong, Roland H. C. Yap:
STR3: A path-optimal filtering algorithm for table constraints. Artif. Intell. 220: 1-27 (2015) - [j12]Christophe Lecoutre, Chavalit Likitvivatanavong, Roland H. C. Yap:
Improving the lower bound of simple tabular reduction. Constraints An Int. J. 20(1): 100-108 (2015) - [c44]Steven Gay, Renaud Hartert, Christophe Lecoutre, Pierre Schaus:
Conflict Ordering Search for Scheduling Problems. CP 2015: 140-148 - [c43]Jean-Baptiste Mairy, Yves Deville, Christophe Lecoutre:
The Smart Table Constraint. CPAIOR 2015: 271-287 - 2014
- [c42]Gilles Audemard, Christophe Lecoutre, Mouny Samy Modeliar, Gilles Goncalves, Daniel Cosmin Porumbel:
Scoring-Based Neighborhood Dominance for the Subgraph Isomorphism Problem. CP 2014: 125-141 - [c41]Nebras Gharbi, Fred Hemery, Christophe Lecoutre, Olivier Roussel:
Sliced Table Constraints: Combining Compression and Tabular Reduction. CPAIOR 2014: 120-135 - [c40]Jean-Baptiste Mairy, Yves Deville, Christophe Lecoutre:
Domain k-Wise Consistency Made as Simple as Generalized Arc Consistency. CPAIOR 2014: 235-250 - [i4]Christophe Lecoutre, Stéphane Cardon, Julien Vion:
Second-Order Consistencies. CoRR abs/1401.3872 (2014) - 2013
- [c39]Christophe Lecoutre, Anastasia Paparrizou, Kostas Stergiou:
Extending STR to a Higher-Order Consistency. AAAI 2013: 576-582 - [c38]Christian Bessiere, Hélène Fargier, Christophe Lecoutre:
Global Inverse Consistency for Interactive Constraint Satisfaction. CP 2013: 159-174 - [c37]Christophe Lecoutre, Nicolas Paris, Olivier Roussel, Sébastien Tabary:
Solving WCSP by Extraction of Minimal Unsatisfiable Cores. ICTAI 2013: 915-922 - [i3]Christophe Lecoutre, Nicolas Paris, Olivier Roussel, Sébastien Tabary:
Solving WCSP by Extraction of Minimal Unsatisfiable Cores. CoRR abs/1304.5449 (2013) - 2012
- [c36]Christophe Lecoutre, Nicolas Paris, Olivier Roussel, Sébastien Tabary:
Propagating Soft Table Constraints. CP 2012: 390-405 - [c35]Christophe Lecoutre, Olivier Roussel, Djamel E. Dehani:
WCSP Integration of Soft Neighborhood Substitutability. CP 2012: 406-421 - [c34]Christophe Lecoutre, Chavalit Likitvivatanavong, Roland H. C. Yap:
A Path-Optimal GAC Algorithm for Table Constraints. ECAI 2012: 510-515 - 2011
- [j11]Christian Bessiere, Stéphane Cardon, Romuald Debruyne, Christophe Lecoutre:
Efficient algorithms for singleton arc consistency. Constraints An Int. J. 16(1): 25-53 (2011) - [j10]Christophe Lecoutre:
STR2: optimized simple tabular reduction for table constraints. Constraints An Int. J. 16(4): 341-371 (2011) - [j9]Frédéric Boussemart, Fred Hemery, Christophe Lecoutre, Mouny Samy Modeliar:
Efficient Constraint Propagation for Graph Coloring. Electron. Notes Discret. Math. 37: 243-248 (2011) - [j8]Christophe Lecoutre, Stéphane Cardon, Julien Vion:
Second-Order Consistencies. J. Artif. Intell. Res. 40: 175-219 (2011) - [c33]Jean-François Condotta, Christophe Lecoutre:
A Framework for Decision-Based Consistencies. CP 2011: 172-186 - 2010
- [j7]Christophe Lecoutre, Olivier Roussel, Marc R. C. van Dongen:
Promoting robust black-box solvers through competitions. Constraints An Int. J. 15(3): 317-326 (2010) - [c32]Jean-François Condotta, Christophe Lecoutre:
A Class of df-Consistencies for Qualitative Constraint Networks. KR 2010
2000 – 2009
- 2009
- [j6]Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal:
Reasoning from last conflict(s) in constraint programming. Artif. Intell. 173(18): 1592-1614 (2009) - [c31]Christophe Lecoutre, Olivier Roussel:
Failed Value Consistencies for Constraint Satisfaction. CP 2009: 554-568 - [c30]Christophe Lecoutre, Sébastien Tabary:
Lightweight Detection of Variable Symmetries for Constraint Satisfaction. ICTAI 2009: 193-197 - [i2]Olivier Roussel, Christophe Lecoutre:
XML Representation of Constraint Networks: Format XCSP 2.1. CoRR abs/0902.2362 (2009) - 2008
- [c29]Christophe Lecoutre:
Optimization of Simple Tabular Reduction for Table Constraints. CP 2008: 128-143 - [c28]Hachemi Bennaceur, Christophe Lecoutre, Olivier Roussel:
A Decomposition Technique for Max-CSP. ECAI 2008: 500-504 - [c27]Radoslaw Szymanek, Christophe Lecoutre:
Constraint-Level Advice for Shaving. ICLP 2008: 636-650 - 2007
- [j5]Ke Xu, Frédéric Boussemart, Fred Hemery, Christophe Lecoutre:
Random constraint satisfaction: Easy generation of hard (satisfiable) instances. Artif. Intell. 171(8-9): 514-534 (2007) - [j4]Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal:
Recording and Minimizing Nogoods from Restarts. J. Satisf. Boolean Model. Comput. 1(3-4): 147-167 (2007) - [j3]Christophe Lecoutre, Lakhdar Sais, Julien Vion:
Using SAT Encodings to Drive CSP Value Ordering Heuristics. J. Satisf. Boolean Model. Comput. 1(3-4): 169-186 (2007) - [c26]Christophe Lecoutre, Stéphane Cardon, Julien Vion:
Conservative Dual Consistency. AAAI 2007: 237-242 - [c25]Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal:
Transposition Tables for Constraint Satisfaction. AAAI 2007: 243-248 - [c24]Christophe Lecoutre, Stéphane Cardon, Julien Vion:
Path Consistency by Dual Consistency. CP 2007: 438-452 - [c23]Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal:
Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance. CP 2007: 453-467 - [c22]Christophe Lecoutre, Fred Hemery:
A Study of Residual Supports in Arc Consistency. IJCAI 2007: 125-130 - [c21]Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal:
Nogood Recording from Restarts. IJCAI 2007: 131-136 - [c20]Dominique D'Almeida, Jean-François Condotta, Christophe Lecoutre, Lakhdar Sais:
Relaxation of Qualitative Constraint Networks. SARA 2007: 93-108 - 2006
- [j2]Sylvain Merchez, Christophe Lecoutre, Frédéric Boussemart:
Abstraction de réseaux de contraintes. Rev. d'Intelligence Artif. 20(1): 31-62 (2006) - [c19]Christophe Lecoutre, Radoslaw Szymanek:
Generalized Arc Consistency for Positive Table Constraints. CP 2006: 284-298 - [c18]Fred Hemery, Christophe Lecoutre, Lakhdar Sais, Frédéric Boussemart:
Extracting MUCs from Constraint Networks. ECAI 2006: 113-117 - [c17]Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal:
Last Conflict Based Reasoning. ECAI 2006: 133-137 - 2005
- [c16]Christophe Lecoutre, Stéphane Cardon:
A Greedy Approach to Establish Singleton Arc Consistency. IJCAI 2005: 199-204 - [c15]Ke Xu, Frédéric Boussemart, Fred Hemery, Christophe Lecoutre:
A Simple Model to Generate Hard Satisfiable Instances. IJCAI 2005: 337-342 - [i1]Ke Xu, Frédéric Boussemart, Fred Hemery, Christophe Lecoutre:
A Simple Model to Generate Hard Satisfiable Instances. CoRR abs/cs/0509032 (2005) - 2004
- [c14]Frédéric Boussemart, Fred Hemery, Christophe Lecoutre, Lakhdar Sais:
Support Inference for Generic Filtering. CP 2004: 721-725 - [c13]Frédéric Boussemart, Fred Hemery, Christophe Lecoutre, Lakhdar Sais:
Boosting Systematic Search by Weighting Constraints. ECAI 2004: 146-150 - [c12]Christophe Lecoutre, Frédéric Boussemart, Fred Hemery:
Backjump-Based Techniques versus Conflict-Directed Heuristics. ICTAI 2004: 549-557 - 2003
- [j1]Frédéric Boussemart, Fred Hemery, Christophe Lecoutre:
De AC3 à AC7. Tech. Sci. Informatiques 22(1): 267-280 (2003) - [c11]Christophe Lecoutre, Frédéric Boussemart, Fred Hemery:
Exploiting Multidirectionality in Coarse-Grained Arc Consistency Algorithms. CP 2003: 480-494 - [c10]Christophe Lecoutre, Frédéric Boussemart, Fred Hemery:
Implicit Random Constraint Satisfaction Problems. ICTAI 2003: 482-486 - [c9]Christophe Lecoutre, Frédéric Boussemart, Fred Hemery:
De AC3 à AC7. JFPLC 2003: 267-280 - 2002
- [c8]Frédéric Boussemart, Guillaume Cavory, Christophe Lecoutre:
Solving the cyclic job shop scheduling problem with linear precedence constraints using CP techniques. SMC (2) 2002: 6 - 2001
- [c7]Sylvain Merchez, Christophe Lecoutre, Frédéric Boussemart:
AbsCon: A Prototype to Solve CSPs with Abstraction. CP 2001: 730-744 - 2000
- [c6]Christophe Lecoutre, Sylvain Merchez, Frédéric Boussemart, Éric Grégoire:
A CSP Abstraction Framework. SARA 2000: 164-184 - [c5]Christophe Lecoutre, Sylvain Merchez, Frédéric Boussemart, Éric Grégoire:
A CSP Abstraction Framework. SARA 2000: 326-327
1990 – 1999
- 1994
- [c4]Christophe Lecoutre:
Une Interprétation abstraite en programmation logique avec contraintes. JFPLC 1994: 189-204 - 1992
- [c3]Christophe Lecoutre, Philippe Devienne, Patrick Lebègue:
Termination induction by means of an abstract OLDT resolution. JFPL 1992: 353-373 - 1991
- [c2]Christophe Lecoutre, Philippe Devienne, Patrick Lebègue:
Abstract Interpretation and Recursive Behaviour of Logic Programs. LOPSTR 1991: 147-166 - [c1]Christophe Lecoutre, Philippe Devienne, Patrick Lebègue:
Une analyse du comportement récursif de programmes Prolog par une interprétation abstraite. JTASPEFT/WSA 1991: 62-69
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-10-11 18:22 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:
