- - Theoretical and Practical Aspects of Constraint Programming
- - Algorithmic and Metaheuristics for the Resolution of SAT
- - Logic for Artificial Intelligence
Sort by type
2011
-
Youssef HAMADI,
Said JABBOUR,
Cédric PIETTE,
Lakhdar SAïS,
« Concilier Parallélisme et Déterminisme dans la Résolution de SAT »,
in Journées Francophones de la Programmation par Contraintes (JFPC'11), pp. A paraitre, june 2011.
[BibTeX]
-
Youssef HAMADI,
Said JABBOUR,
Cédric PIETTE,
Lakhdar SAïS,
« Deterministic Parallel DPLL: System Description »,
in Pragmatics of SAT (POS'11), june 2011.
[BibTeX]
-
Philippe BESNARD,
Éric GRéGOIRE,
Cédric PIETTE,
Badran RADDAOUI,
« Génération d'arguments et contre-arguments par calcul de MUS »,
in 10e Rencontres des Jeunes Chercheurs en Intelligence Artificielle (RJCIA'11), pp. A paraître, may 2011.
[BibTeX]
-
Youssef HAMADI,
Said JABBOUR,
Cédric PIETTE,
Lakhdar SAïS,
« Deterministic Parallel (DP)2LL »,
Technical report, Microsoft Research Cambridge, april 2011.
[pdf][BibTeX]
-
Youssef HAMADI,
Said JABBOUR,
Cédric PIETTE,
Lakhdar SAïS,
« Deterministic Parallel DPLL »,
in Journal on Satisfiability, Boolean Modeling and Computation (JSAT), vol. 7, n° 4, pp. 127-132, 2011.
[pdf][BibTeX]
2010
-
Philippe BESNARD,
Éric GRéGOIRE,
Cédric PIETTE,
Badran RADDAOUI,
« MUS-Based Generation of Arguments and Counter-arguments »,
in 11th IEEE International Conference on Information Reuse and Integration (IRI'10), pp. 239-244, august 2010.
[pdf][BibTeX]
-
Souhila KACI,
Cédric PIETTE,
« Ordering Intervals: From Qualitative Temporal Constraint Problems to Preference Representation »,
in 10th Workshop on Preferences and Soft Constraints (Co-located with CP 2010) (SOFT10), pp. to appear, august 2010.
[BibTeX]
2009
-
Éric GRéGOIRE,
Bertrand MAZURE,
Cédric PIETTE,
« Using local search to find MSSes and MUSes »,
in European Journal of Operational Research , vol. 199, n° 3, pp. 640-646, december 2009.
[pdf][BibTeX]
-
Cédric PIETTE,
Youssef HAMADI,
Lakhdar SAïS,
« Efficient Combination of Decision Procedure for MUS Computation »,
in The 7th International Symposium on Frontiers of Combining Systems (FroCos'09), LNCS, pp. 335-349, september 2009.
[pdf][BibTeX]
-
Éric GRéGOIRE,
Bertrand MAZURE,
Cédric PIETTE,
« Does this set of clauses overlap with at least one MUS? »,
in 22nd International Conference on Automated Deduction (CADE 22), LNCS, pp. 100-115, august 2009.
[pdf][BibTeX]
-
Éric GRéGOIRE,
Bertrand MAZURE,
Cédric PIETTE,
« Localiser des sources d'incohérence spécifiques sans les calculer toutes »,
in Journées Francophones de la Programmation par Contraintes (JFPC'09), pp. 95-104, june 2009.
[pdf][BibTeX]
-
Souhila KACI,
Cédric PIETTE,
« Looking for the Best and the Worst »,
in Colloque sur l'Optimisation et les Systèmes d'Information (COSI'09), pp. To appear, may 2009.
[BibTeX]
2008
-
Cédric PIETTE,
« Let the Solver Deal with Redundancy »,
in The 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'08), pp. 67-73, november 2008.
[pdf][BibTeX]
-
Éric GRéGOIRE,
Bertrand MAZURE,
Cédric PIETTE,
« On Approaches to Explaining Infeasibility of Sets of Boolean Clauses »,
in The 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'08), pp. 74-83, november 2008.
[pdf][BibTeX]
-
Cédric PIETTE,
« Redondance dans les CNF : laissons le solveur agir »,
in Journées Nationales de l'Intelligence Artificielle Fondamentale (IAF'08), october 2008.
[pdf][BibTeX]
-
Éric GRéGOIRE,
Bertrand MAZURE,
Cédric PIETTE,
« On Finding Minimally Unsatisfiable Cores of CSPs »,
in International Journal on Artificial Intelligence Tools (IJAIT), vol. 17, n° 4, pp. 745 - 763, august 2008.
[pdf][BibTeX]
-
Cédric PIETTE,
Youssef HAMADI,
Lakhdar SAïS,
« Vivifying propositional clausal formulae »,
in 18th European Conference on Artificial Intelligence (ECAI'08), pp. 525-529, july 2008.
[pdf][BibTeX]
-
Cédric PIETTE,
Youssef HAMADI,
Lakhdar SAïS,
« Vivification de formules propositionnelles clausales »,
in Quatrièmes Journées Francophones de Programmation par Contraintes (JFPC'08), pp. 277-286, june 2008.
[pdf][BibTeX]
-
Éric GRéGOIRE,
Bertrand MAZURE,
Cédric PIETTE,
« Extraction d'ensembles minimaux conflictuels basée sur la recherche locale »,
in Revue d'Intelligence Artificielle (RSTI- RIA), vol. 22, n° 2, pp. 161-181, april 2008.
[BibTeX]
-
Cédric PIETTE,
Youssef HAMADI,
Lakhdar SAïS,
« preSAT: SAT Solver Description »,
Technical report, CRIL, april 2008.
[pdf][BibTeX]
-
Éric GRéGOIRE,
Bertrand MAZURE,
Cédric PIETTE,
« Explication et réparation de l'incohérence dans les CSP : de la contrainte au tuple »,
in 16ème congrès francophone Reconnaissance des Formes et Intelligence Artificielle (RFIA'08), pp. 258-267, january 2008.
[pdf][BibTeX]
-
Éric GRéGOIRE,
Bertrand MAZURE,
Cédric PIETTE,
« Sous-formules minimales insatisfaisables »,
in Problème SAT : progrès et défis, chapter 8, Lakhdar Saïs(Eds.), Hermes, 2008.
[BibTeX]
-
Éric GRéGOIRE,
Bertrand MAZURE,
Cédric PIETTE,
« MUST et couvertures de MUST pour l'explication et la réparation de CSP incohérents au niveau tuple »,
in Information-Interaction-Intelligence (Revue I3), vol. 8, n° 2, pp. 181-202, 2008.
[BibTeX]
2007
-
Cédric PIETTE,
« Techniques algorithmiques pour l'extraction de formules minimales inconsistantes »,
PhD Thesis, Université d'Artois, Lens, november 2007.
[pdf][BibTeX]
-
Éric GRéGOIRE,
Bertrand MAZURE,
Cédric PIETTE,
« Local-Search Extraction of MUSes »,
in Constraints , vol. 12, n° 3, pp. 325-344, september 2007.
[pdf][BibTeX]
-
Éric GRéGOIRE,
Bertrand MAZURE,
Cédric PIETTE,
« MUST: Provide a Finer-Grained Explanation of Unsatisfiability »,
in 13th International Conference on Principles and Practice of Constraint Programming (CP'07), LNCS 4741, pp. 317-331, september 2007.
[pdf][BibTeX]
-
Éric GRéGOIRE,
Bertrand MAZURE,
Cédric PIETTE,
« Une nouvelle méthode hybride pour calculer tous les MSS et tous les MUS »,
in 3èmes Journées Francophones de Programmation par Contraintes (JFPC'07), pp. 143-150, june 2007.
[pdf][BibTeX]
-
Éric GRéGOIRE,
Bertrand MAZURE,
Cédric PIETTE,
« Boosting a Complete Technique to Find MSS and MUS thanks to a Local Search Oracle »,
in International Joint Conference on Artificial Intelligence (IJCAI'07), pp. 2300-2305, january 2007.
[pdf][BibTeX]
2006
-
Éric GRéGOIRE,
Bertrand MAZURE,
Cédric PIETTE,
« Une méta-heuristique basée sur le comptage de contraintes falsifiées »,
in First workshop on Metaheuristics (META'06), Actes électroniques, november 2006.
[pdf][BibTeX]
-
Éric GRéGOIRE,
Bertrand MAZURE,
Cédric PIETTE,
« Tracking MUSes and Strict Inconsistent Covers »,
in Sixth ACM/IEEE International Conference on Formal Methods in Computer Aided Design (FMCAD'06), pp. 39-46, november 2006.
[pdf][BibTeX]
-
Éric GRéGOIRE,
Bertrand MAZURE,
Cédric PIETTE,
Lakhdar SAïS,
« A New Heuristic-based albeit Complete Method to Extract MUCs from Unsatisfiable CSPs »,
in Proceedings of the IEEE International Conference on Information Reuse and Integration (IEEE-IRI'2006), pp. 325-329, september 2006.
[pdf][BibTeX]
-
Éric GRéGOIRE,
Bertrand MAZURE,
Cédric PIETTE,
« Extracting MUSes »,
in 17th European Conference on Artificial Intelligence (ECAI'06), pp. 387-391, august 2006.
[pdf][BibTeX]
-
Éric GRéGOIRE,
Bertrand MAZURE,
Cédric PIETTE,
« Extraction de sous-formules minimales inconsistantes »,
in Secondes Journées Francophones de Programmation par Contraintes (JFPC'06), pp. 201-208, june 2006.
[pdf][BibTeX]
2005
-
Éric GRéGOIRE,
Bertrand MAZURE,
Cédric PIETTE,
« A new local search algorithm to compute inconsistent kernels »,
in 6th International Meta-heuristics International Conference (MIC'05), Actes électroniques, august 2005.
[pdf][BibTeX]
-
Cédric PIETTE,
« Méta-heuristiques pour la détection de noyaux inconsistants minimaux »,
Master Thesis, Lens, France, july 2005.
[BibTeX]
Coauthors list
- Éric GRéGOIRE (21)
- Bertrand MAZURE (19)
- Lakhdar SAïS (9)
- Youssef HAMADI (8)
- Said JABBOUR (4)
- Souhila KACI (2)
- Philippe BESNARD (2)
- Badran RADDAOUI (2)
- (A)OMUS is a "Local-search oriented MUS extractor", formally presented here : [pdf]. A comparison between techniques enabling to approximate one MUS, and another one where the focus is on extracting exactly one MUS are also available. The source code is available here.
AOMUS can be integrated into the new MUS extractor MiniUnsat, developped by Siert Wieringa. This combination of algorithms appears to deliver very good results in practice, as presented in the paper "Finding guaranteed MUSes fast" (by Hans van Maaren and Siert Wieringa, SAT'08).
- HYCAMis an improved version of an algorithm of Mark Liffiton and Karem Sakallah (based on Minisat) that aims to compute all MUS contained in a CNF. It is actually an hybridization with a local search that enables to gain an order of magnitude in many cases, without being slower in others cases. The main idea is presented here : [pdf], and the binaries of the procedure are available here.
- The MUC Extraction Page This page proposes a recent heuristic-based approach to compute infeasible minimal subparts of discrete CSPs, also called Minimally Unsatisfiable Cores (MUCs). This approach, called CB(full-wcore), is based on the heuristic exploitation of the number of times each constraint has been falsified during previous failed search steps. It appears to enhance the performance of the initial technique, which was the most efficient one until now. Binaries, experimental results and benchmarks are available [here].
- MUSTER is a "Minimally Unsatisfiable Set of Tuples" (MUST) of CSP extractor, presented here : [pdf]. The code is really messy, so it is not available for now. I am developping a new version, planned to be released for 2009.
-
ReVivAl
Developped from a collaboration between Youssef Hamadi, Lakhdar Saïs and myself, ReVivAl (for pReprocessing based on Vivification Algorithm) is a new efficient preprocessor for CNF formulae that aims at producing sub-clauses and generating new relevent clauses. Its efficiecy relies on its full integration into a modern SAT solver. Hence, its computation benefits from the classical components of modern DPLLs (watched literals, learning scheme, VSIDS-like heuristics, etc.), boosting (sub-)clauses production.
The ReVivAl webpage is available here.
A new version of ReVivAl (0.23) is available. This version has been evaluated in an empirical point of view; synthesis and detailled results are available here.
New !
Different combinations of ReVivAl and SatElite have been submitted to the preprocessor track of the SAT competition 2009. In the final results, the submitted procedure came in
2nd for both APPLICATION and CRAFTED categories (and 1st in the UNSAT CRAFTED category).
- 2008-2009 :
-
- Data structures
-
- Web Programming
-
- Network
-
- Information Systems
-
- Databases
-
- Object-Oriented Programming
- 2007-2008 :
-
- "Internet & Computer Science" Certificate
(57h)
-
- xHTML / CSS
(15h)
-
- Algorithmic level 3
(24h)
- 2006-2007 :
-
- Advanced C
(21h)
-
- Introduction to UNIX / C
(39h)
-
- "Internet & Computer Science" Certificate
(27h)
- 2005-2006 :
-
- Advanced C
(30h)
-
- Spreadsheet / Data Base
(with OpenOffice)
(30h)
-
- Introduction to UNIX / C
(21h)
-
- HTML / PHP
(5h15)
- 2004-2005 :
-
- Introduction to Maple
(24h)
- Since June 2008
- - Member of the administration council of AFPC: French Association for Constraint Programming
- November 2006-August 2009
- November 2004-November 2006
