default search action
Thierry Petit
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i8]Thierry Petit, Arnault Pachot, Claire Conan-Vrinat, Alexandre Dubarry:
Declarative Integration and Management of Large Language Models through Finite Automata: Application to Automation, Communication, and Ethics. CoRR abs/2409.13693 (2024) - 2021
- [i7]Thierry Petit, Randy J. Zauhar:
A Constraint Programming Approach to Weighted Isomorphic Mapping of Fragment-based Shape Signatures. CoRR abs/2112.10892 (2021)
2010 – 2019
- 2019
- [j7]Thierry Petit, Andrew C. Trapp
:
Enriching Solutions to Combinatorial Problems via Solution Engineering. INFORMS J. Comput. 31(3): 429-444 (2019) - 2017
- [c33]Thierry Petit:
On Constraint Linear Decompositions Using Mathematical Variables. ICTAI 2017: 123-130 - 2016
- [j6]Nina Narodytska, Thierry Petit, Mohamed Siala
Three generalizations of the FOCUS constraint. Constraints An Int. J. 21(4): 495-532 (2016) - [c32]Thierry Petit, Lolita Petit:
Optimizing Molecular Cloning of Multiple Plasmids. IJCAI 2016: 773-779 - [i6]Thierry Petit:
"Model and Run" Constraint Networks with a MILP Engine. CoRR abs/1611.08908 (2016) - 2015
- [c31]Alban Derrien, Jean-Guillaume Fages
A Global Constraint for a Tractable Class of Temporal Optimization Problems. CP 2015: 105-120 - [c30]Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Xavier Lorca, Justin Pearson, Thierry Petit, Charles Prud'homme:
A Modelling Pearl with Sortedness Constraints. GCAI 2015: 27-41 - [c29]Thierry Petit, Andrew C. Trapp:
Finding Diverse Solutions of High Quality to Constraint Optimization Problems. IJCAI 2015: 260-267 - 2014
- [b1]Thierry Petit:
Concilier Expressivité et Efficacité en Programmation par Contraintes. University of Nantes, France, 2014 - [c28]Alban Derrien, Thierry Petit:
A New Characterization of Relevant Intervals for Energetic Reasoning. CP 2014: 289-297 - [c27]Alban Derrien, Thierry Petit, Stéphane Zampelli:
A Declarative Paradigm for Robust Cumulative Scheduling. CP 2014: 298-306 - [c26]Jean-Guillaume Fages, Xavier Lorca
Self-decomposable Global Constraints. ECAI 2014: 297-302 - [i5]Alban Derrien, Thierry Petit, Stéphane Zampelli:
Dynamic Sweep Filtering Algorithm for FlexC. CoRR abs/1408.5377 (2014) - 2013
- [c25]Nina Narodytska, Thierry Petit, Mohamed Siala
Three Generalizations of the FOCUS Constraint. IJCAI 2013: 630-636 - [i4]Nina Narodytska, Thierry Petit, Mohamed Siala
Three Generalizations of the FOCUS Constraint. CoRR abs/1304.5970 (2013) - [i3]Alban Derrien, Thierry Petit:
The Energetic Reasoning Checker Revisited. CoRR abs/1310.5564 (2013) - 2012
- [c24]Thierry Petit:
Focus : A Constraint for Concentrating High Costs. CP 2012: 577-592 - [c23]Nicolas Beldiceanu, Mats Carlsson, Thierry Petit, Jean-Charles Régin:
An O(nlog n) Bound Consistency Algorithm for the Conjunction of an alldifferent and an Inequality between a Sum of Variables and a Constant, and its Generalization. ECAI 2012: 145-150 - [c22]Thierry Petit:
Intermediary Local Consistencies. ECAI 2012: 919-920 - 2011
- [j5]Thierry Petit, Emmanuel Poder:
Global propagation of side constraints for solving over-constrained problems. Ann. Oper. Res. 184(1): 295-314 (2011) - [j4]Thierry Petit, Jean-Charles Régin:
The Ordered Distribute Constraint. Int. J. Artif. Intell. Tools 20(4): 617-637 (2011) - [c21]Alexis De Clercq, Thierry Petit, Nicolas Beldiceanu, Narendra Jussien:
Filtering Algorithms for Discrete Cumulative Problems with Overloads of Resource. CP 2011: 240-255 - [c20]Thierry Petit, Jean-Charles Régin, Nicolas Beldiceanu:
A Θ(n) Bound-Consistency Algorithm for the Increasing Sum Constraint. CP 2011: 721-728 - [c19]Jean-Charles Régin, Thierry Petit:
The Objective Sum Constraint. CPAIOR 2011: 190-195 - [c18]Thierry Petit, Nicolas Beldiceanu, Xavier Lorca
A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints. IJCAI 2011: 643-648 - [i2]Thierry Petit, Nicolas Beldiceanu, Xavier Lorca
A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints: Revised Edition that Incorporates One Correction. CoRR abs/1110.4719 (2011) - 2010
- [c17]Nicolas Beldiceanu, Fabien Hermenier, Xavier Lorca
The Increasing Nvalue Constraint. CPAIOR 2010: 25-39 - [c16]Thierry Petit, Jean-Charles Régin:
The Ordered Distribute Constraint. ICTAI (1) 2010: 431-438
2000 – 2009
- 2009
- [c15]Julien Vion, Thierry Petit, Narendra Jussien:
Integrating Strong Local Consistencies into Constraint Solvers. CSCLP 2009: 90-104 - [c14]Christian Bessiere, Thierry Petit, Bruno Zanuttini:
Making Bound Consistency as Effective as Arc Consistency. IJCAI 2009: 425-430 - [i1]Thierry Petit, Emmanuel Poder:
The Soft Cumulative Constraint. CoRR abs/0907.0939 (2009) - 2008
- [c13]Thierry Petit, Emmanuel Poder:
Global Propagation of Practicability Constraints. CPAIOR 2008: 361-366 - 2007
- [j3]Nicolas Beldiceanu, Mats Carlsson, Sophie Demassey
Global Constraint Catalogue: Past, Present and Future. Constraints An Int. J. 12(1): 21-62 (2007) - [c12]Christian Bessiere, Remi Coletta, Thierry Petit:
Learning Implied Global Constraints. IJCAI 2007: 44-49 - 2006
- [j2]Nicolas Beldiceanu, Thierry Petit, Guillaume Rochart:
Bounds of graph parameters for global constraints. RAIRO Oper. Res. 40(4): 327-353 (2006) - [c11]Nicolas Beldiceanu, Mats Carlsson, Sophie Demassey
Graph Properties Based Filtering. CP 2006: 59-74 - 2005
- [j1]Nicolas Beldiceanu, Mats Carlsson, Romuald Debruyne, Thierry Petit:
Reformulation of Global Constraints Based on Constraints Checkers. Constraints An Int. J. 10(4): 339-362 (2005) - [c10]Nicolas Beldiceanu, Thierry Petit, Guillaume Rochart:
Bounds of Graph Characteristics. CP 2005: 742-746 - [c9]Christian Bessiere, Remi Coletta, Thierry Petit:
Acquiring Parameters of Implied Global Constraints. CP 2005: 747-751 - 2004
- [c8]Nicolas Beldiceanu, Mats Carlsson, Thierry Petit:
Deriving Filtering Algorithms from Constraint Checkers. CP 2004: 107-122 - [c7]Nicolas Beldiceanu, Thierry Petit:
Cost Evaluation of Soft Global Constraints. CPAIOR 2004: 80-95 - 2002
- [c6]Thierry Petit, Jean-Charles Régin, Christian Bessière:
Range-Based Algorithm for Max-CSP. CP 2002: 280-294 - [c5]Jean-Charles Régin, Jean-Francois Puget, Thierry Petit:
Representation of soft constraints by hard constraints. JFPLC 2002: 181- - 2001
- [c4]Jean-Charles Régin, Thierry Petit, Christian Bessière, Jean-Francois Puget:
New Lower Bounds of Constraint Violations for Over-Constrained Problems. CP 2001: 332-345 - [c3]Thierry Petit, Jean-Charles Régin, Christian Bessière:
Specific Filtering Algorithms for Over-Constrained Problems. CP 2001: 451-463 - 2000
- [c2]Jean-Charles Régin, Thierry Petit, Christian Bessière, Jean-Francois Puget:
An Original Constraint Based Approach for Solving over Constrained Problems. CP 2000: 543-548 - [c1]Thierry Petit, Jean-Charles Régin, Christian Bessière:
Meta-constraints on violations for over constrained problems. ICTAI 2000: 358-365
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-16 21:23 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: