Cédric Piette

According to our database1, Cédric Piette authored at least 25 papers between 2006 and 2020.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
XCSP3-core: A Format for Representing Constraint Satisfaction/Optimization Problems.
CoRR, 2020

XCSP<sup>3</sup> and its ecosystem.
Constraints An Int. J., 2020

2019
Ludii and XCSP: Playing and Solving Logic Puzzles.
Proceedings of the IEEE Conference on Games, 2019

2016
XCSP3: An Integrated Format for Benchmarking Combinatorial Constrained Problems.
CoRR, 2016

2014
Dolius: A Distributed Parallel SAT Solving Framework.
Proceedings of the POS-14. Fifth Pragmatics of SAT workshop, 2014

An Effective Distributed D&C Approach for the Satisfiability Problem.
Proceedings of the 22nd Euromicro International Conference on Parallel, 2014

2013
Solving E-Squaro through SAT-Coding.
Proceedings of the 25th IEEE International Conference on Tools with Artificial Intelligence, 2013

2012
Calcul d'arguments et de contre-arguments fondé sur les noyaux inconsistants.
Rev. d'Intelligence Artif., 2012

Revisiting Clause Exchange in Parallel SAT Solving.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

2011
Deterministic Parallel DPLL.
J. Satisf. Boolean Model. Comput., 2011

2010
MUS-based generation of arguments and counter-arguments.
Proceedings of the IEEE International Conference on Information Reuse and Integration, 2010

2009
Using local search to find MSSes and MUSes.
Eur. J. Oper. Res., 2009

Efficient Combination of Decision Procedures for MUS Computation.
Proceedings of the Frontiers of Combining Systems, 7th International Symposium, 2009

Does This Set of Clauses Overlap with at Least One MUS?
Proceedings of the Automated Deduction, 2009

2008
Extraction d'ensembles minimaux incohérents basée sur la recherche locale.
Rev. d'Intelligence Artif., 2008

On Finding Minimally Unsatisfiable Cores of CSPS.
Int. J. Artif. Intell. Tools, 2008

Let the Solver Deal with Redundancy.
Proceedings of the 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2008), 2008

On Approaches to Explaining Infeasibility of Sets of Boolean Clauses.
Proceedings of the 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2008), 2008

Vivifying Propositional Clausal Formulae.
Proceedings of the ECAI 2008, 2008

2007
Local-search Extraction of MUSes.
Constraints An Int. J., 2007

Boosting a Complete Technique to Find MSS and MUS Thanks to a Local Search Oracle.
Proceedings of the IJCAI 2007, 2007

MUST: Provide a Finer-Grained Explanation of Unsatisfiability.
Proceedings of the Principles and Practice of Constraint Programming, 2007

2006
A new heuristic-based albeit complete method to extract MUCs from unsatisfiable CSPs.
Proceedings of the 2006 IEEE International Conference on Information Reuse and Integration, 2006

Tracking MUSes and Strict Inconsistent Covers.
Proceedings of the Formal Methods in Computer-Aided Design, 6th International Conference, 2006

Extracting MUSes.
Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006


  Loading...