Clément Carbonnel

Orcid: 0000-0003-2312-2687

According to our database1, Clément Carbonnel authored at least 22 papers between 2013 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Corrigendum to "Learning constraints through partial queries" [Artificial Intelligence 319 (2023) 103896].
Artif. Intell., March, 2024

2023
Complexity of minimum-size arc-inconsistency explanations.
Constraints An Int. J., September, 2023

Learning constraints through partial queries.
Artif. Intell., June, 2023

Tractable Explaining of Multivariate Decision Trees.
Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, 2023

Learning Constraint Networks over Unknown Constraint Languages.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022
The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side.
SIAM J. Comput., 2022

On Redundancy in Constraint Satisfaction Problems.
Proceedings of the 28th International Conference on Principles and Practice of Constraint Programming, 2022

2020
Point-Width and Max-CSPs.
ACM Trans. Algorithms, 2020

Partial Queries for Constraint Acquisition.
CoRR, 2020

Chain Length and CSPs Learnable with Few Queries.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
On Singleton Arc Consistency for CSPs Defined by Monotone Patterns.
Algorithmica, 2019

2018
The Complexity of General-Valued CSPs Seen from the Other Side.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017
On Singleton Arc Consistency for Natural CSPs Defined by Forbidden Patterns.
CoRR, 2017

On the Kernelization of Global Constraints.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016
Harnessing tractability in constraint satisfaction problems. (Exploiter la traçabilité dans les problèmes de satisfaction des contraintes ).
PhD thesis, 2016

Tractability in constraint satisfaction problems: a survey.
Constraints An Int. J., 2016

Propagation via Kernelization: The Vertex Cover Constraint.
Proceedings of the Principles and Practice of Constraint Programming, 2016

The Dichotomy for Conservative Constraint Satisfaction is Polynomially Decidable.
Proceedings of the Principles and Practice of Constraint Programming, 2016

The Meta-Problem for Conservative Mal'tsev Constraints.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2014
On Backdoors to Tractable Constraint Languages.
Proceedings of the Principles and Practice of Constraint Programming, 2014

Q-Intersection Algorithms for Constraint-Based Robust Parameter Estimation.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
Detecting and Exploiting Subproblem Tractability.
Proceedings of the IJCAI 2013, 2013


  Loading...