
Search the dblp DataBase
Cédric Piette:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Éric Grégoire, Bertrand Mazure, Cédric Piette
Extracting MUSes. [Citation Graph (0, 0)][DBLP] ECAI, 2006, pp:387391 [Conf]
 Éric Grégoire, Bertrand Mazure, Cédric Piette
Tracking MUSes and Strict Inconsistent Covers. [Citation Graph (0, 0)][DBLP] FMCAD, 2006, pp:3946 [Conf]
 Éric Grégoire, Bertrand Mazure, Cédric Piette
Boosting a Complete Technique to Find MSS and MUS Thanks to a Local Search Oracle. [Citation Graph (0, 0)][DBLP] IJCAI, 2007, pp:23002305 [Conf]
 Éric Grégoire, Bertrand Mazure, Cédric Piette, Lakhdar Sais
A new heuristicbased albeit complete method to extract MUCs from unsatisfiable CSPs. [Citation Graph (0, 0)][DBLP] IRI, 2006, pp:325329 [Conf]
 Éric Grégoire, Bertrand Mazure, Cédric Piette
MUST: Provide a FinerGrained Explanation of Unsatisfiability. [Citation Graph (0, 0)][DBLP] CP, 2007, pp:317331 [Conf]
 Éric Grégoire, Bertrand Mazure, Cédric Piette
Localsearch Extraction of MUSes. [Citation Graph (0, 0)][DBLP] Constraints, 2007, v:12, n:3, pp:325344 [Journal]
Does This Set of Clauses Overlap with at Least One MUS? [Citation Graph (, )][DBLP]
Vivifying Propositional Clausal Formulae. [Citation Graph (, )][DBLP]
Efficient Combination of Decision Procedures for MUS Computation. [Citation Graph (, )][DBLP]
Let the Solver Deal with Redundancy. [Citation Graph (, )][DBLP]
On Approaches to Explaining Infeasibility of Sets of Boolean Clauses. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
