default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClément Carbonnel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Christian Bessiere, Clément Carbonnel, Anton Dries, Emmanuel Hebrard, George Katsirelos, Nadjib Lazaar, Nina Narodytska, Claude-Guy Quimper, Kostas Stergiou, Dimosthenis C. Tsouros, Toby Walsh:
Corrigendum to "Learning constraints through partial queries" [Artificial Intelligence 319 (2023) 103896]. Artif. Intell. 328: 104075 (2024)- 2023
- [j6]Christian Bessiere
, Clément Carbonnel, Anton Dries, Emmanuel Hebrard, George Katsirelos, Nadjib Lazaar, Nina Narodytska, Claude-Guy Quimper, Kostas Stergiou, Dimosthenis C. Tsouros, Toby Walsh:
Learning constraints through partial queries. Artif. Intell. 319: 103896 (2023) - [j5]Christian Bessiere, Clément Carbonnel, Martin C. Cooper, Emmanuel Hebrard:
Complexity of minimum-size arc-inconsistency explanations. Constraints An Int. J. 28(3): 427-449 (2023) - [c15]Christian Bessiere, Clément Carbonnel, Areski Himeur:
Learning Constraint Networks over Unknown Constraint Languages. IJCAI 2023: 1876-1883 - [c14]Clément Carbonnel, Martin C. Cooper, João Marques-Silva:
Tractable Explaining of Multivariate Decision Trees. KR 2023: 127-135 - 2022
- [j4]Clément Carbonnel, Miguel Romero, Stanislav Zivný:
The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side. SIAM J. Comput. 51(1): 19-69 (2022) - [c13]Christian Bessiere, Clément Carbonnel, Martin C. Cooper, Emmanuel Hebrard:
Complexity of Minimum-Size Arc-Inconsistency Explanations. CP 2022: 9:1-9:14 - [c12]Clément Carbonnel:
On Redundancy in Constraint Satisfaction Problems. CP 2022: 11:1-11:15 - 2020
- [j3]Clément Carbonnel, Miguel Romero, Stanislav Zivný:
Point-Width and Max-CSPs. ACM Trans. Algorithms 16(4): 54:1-54:28 (2020) - [c11]Christian Bessiere, Clément Carbonnel, George Katsirelos:
Chain Length and CSPs Learnable with Few Queries. AAAI 2020: 1420-1427 - [i7]Christian Bessiere, Clément Carbonnel, Anton Dries, Emmanuel Hebrard, George Katsirelos, Nadjib Lazaar, Nina Narodytska, Claude-Guy Quimper, Kostas Stergiou, Dimosthenis C. Tsouros, Toby Walsh:
Partial Queries for Constraint Acquisition. CoRR abs/2003.06649 (2020)
2010 – 2019
- 2019
- [j2]Clément Carbonnel, David A. Cohen, Martin C. Cooper, Stanislav Zivný:
On Singleton Arc Consistency for CSPs Defined by Monotone Patterns. Algorithmica 81(4): 1699-1727 (2019) - [c10]Clément Carbonnel, Miguel Romero, Stanislav Zivný:
Point-width and Max-CSPs. LICS 2019: 1-13 - [i6]Clément Carbonnel, Miguel Romero, Stanislav Zivný:
Point-width and Max-CSPs. CoRR abs/1904.07388 (2019) - 2018
- [c9]Clément Carbonnel, Miguel Romero, Stanislav Zivný:
The Complexity of General-Valued CSPs Seen from the Other Side. FOCS 2018: 236-246 - [c8]Clément Carbonnel, David A. Cohen, Martin C. Cooper, Stanislav Zivný:
On Singleton Arc Consistency for CSPs Defined by Monotone Patterns. STACS 2018: 19:1-19:15 - 2017
- [c7]Clément Carbonnel, Emmanuel Hebrard:
On the Kernelization of Global Constraints. IJCAI 2017: 578-584 - [i5]Clément Carbonnel, Emmanuel Hébrard:
Propagation via Kernelization: The Vertex Cover Constraint. CoRR abs/1702.02470 (2017) - [i4]Clément Carbonnel, David A. Cohen, Martin C. Cooper, Stanislav Zivný:
On Singleton Arc Consistency for Natural CSPs Defined by Forbidden Patterns. CoRR abs/1704.06215 (2017) - [i3]Clément Carbonnel, Miguel Romero, Stanislav Zivný:
The complexity of general-valued CSPs seen from the other side. CoRR abs/1710.03148 (2017) - 2016
- [b1]Clément Carbonnel:
Harnessing tractability in constraint satisfaction problems. (Exploiter la traçabilité dans les problèmes de satisfaction des contraintes ). National Polytechnic Institute of Toulouse, France, 2016 - [j1]Clément Carbonnel, Martin C. Cooper:
Tractability in constraint satisfaction problems: a survey. Constraints An Int. J. 21(2): 115-144 (2016) - [c6]Clément Carbonnel:
The Meta-Problem for Conservative Mal'tsev Constraints. AAAI 2016: 3376-3382 - [c5]Clément Carbonnel:
The Dichotomy for Conservative Constraint Satisfaction is Polynomially Decidable. CP 2016: 130-146 - [c4]Clément Carbonnel, Emmanuel Hebrard:
Propagation via Kernelization: The Vertex Cover Constraint. CP 2016: 147-156 - [i2]Clément Carbonnel:
The Dichotomy for Conservative Constraint Satisfaction is Polynomially Decidable. CoRR abs/1604.07063 (2016) - 2014
- [c3]Clément Carbonnel, Gilles Trombettoni, Philippe Vismara, Gilles Chabert:
Q-Intersection Algorithms for Constraint-Based Robust Parameter Estimation. AAAI 2014: 2630-2636 - [c2]Clément Carbonnel, Martin C. Cooper, Emmanuel Hebrard:
On Backdoors to Tractable Constraint Languages. CP 2014: 224-239 - [i1]Clément Carbonnel, Martin C. Cooper, Emmanuel Hebrard:
On Backdoors To Tractable Constraint Languages. CoRR abs/1404.3675 (2014) - 2013
- [c1]Christian Bessiere, Clément Carbonnel, Emmanuel Hebrard, George Katsirelos, Toby Walsh:
Detecting and Exploiting Subproblem Tractability. IJCAI 2013: 468-474
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 2025-01-09 13:08 CET 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:
