Publications

Article(s) de revue(s) internationale(s)

2017 Balasim Al-Saedi, Olivier Fourdrinoy, Éric Grégoire, Bertrand Mazure, Lakhdar Saïs, About some UP-based polynomial fragments of SAT in International Journal of Annals of Mathematics and Artificial Intelligence (AMAI),vol. 79, n° 1, pp. 25-44, février 2017.

2015 Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi, Mining Top-k motifs with a SAT-based framework in Artificial Intelligence (AIJ),2015. [Download]

2012 Youssef Hamadi, Saïd Jabbour, Lakhdar Saïs, Learning from Conflicts in Propositional Satisfiability in A Quarterly Journal of Operations Research (4OR),vol. 1, n° 10, pp. 15-32, 2012.

2011 Youssef Hamadi, Saïd 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. [Download]

2010 Youssef Hamadi, Saïd Jabbour, Lakhdar Saïs, Learning for Dynamic Subsumption in International Journal on Artificial Intelligence Tools (IJAIT),vol. 19, n° 4, pp. 511-529, 2010.

2009 Youssef Hamadi, Saïd Jabbour, Lakhdar Saïs, ManySAT: a parallel SAT solver. in Journal on Satisfiability, Boolean Modeling and Computation (JSAT),vol. 6, IOS Press, pp. 245-262, 2009.

2009 Christophe Lecoutre, Lakhdar Saïs, Sébastien Tabary, Vincent Vidal, Reasoning from Last Conflict(s) in Constraint Programming in Artificial Intelligence Journal (AIJ),vol. 173, n° 18, Elsevier, pp. 1592-1614, decembre 2009. [Download]

2008 Gilles Audemard, Saïd Jabbour, Lakhdar Saïs, SAT Graph-Based Representation: A New Perspective in Journal of Algorithms,vol. 63, pp. 17–33, 2008. [Download]

2007 Christophe Lecoutre, Lakhdar Saïs, Sébastien Tabary, Vincent Vidal, Recording and Minimizing Nogoods from Restarts in Journal on Satisfiability, Boolean Modeling and Computation (JSAT),vol. 1, pp. 147-167, mai 2007. [Download]

2007 Christophe Lecoutre, Lakhdar Saïs, Julien Vion, Using SAT Encodings to derive CSP value ordering heuristics in Journal on Satisfiability, Boolean Modeling and Computation (JSAT),vol. 1, pp. 169-186, mai 2007. [Download]

2001 Laure Brisoux, Éric Grégoire, Lakhdar Saïs, Checking depth-limited consistency and inconsistency in knowledge-based systems in International Journal of Information Systems (IJIS),vol. 16, n° 3, pp. 333-360, 2001.

2000 Éric Grégoire, Lakhdar Saïs, Practical inconsistency management for critical-tasks decision-support systems in International Journal of General Systems,vol. 29, n° 1, pp. 123-140, 2000.

1998 Bertrand Mazure, Lakhdar Saïs, Éric Grégoire, Boosting complete techniques thanks to local search in Annals of Mathematics and Artificial Intelligence,vol. 22, pp. 309-322, 1998.

1997 Bertrand Mazure, Lakhdar Saïs, Éric Grégoire, An efficient technique to ensure the logical consistency of cooperative agents in International Journal of Cooperative Information Systems,vol. 6, n° 1, pp. 27-36, 1997.

1994 Belaid Benhamou, Lakhdar Saïs, Tractability through symmetries in propositional calculus in Journ. of Automated Reasoning,vol. 12, pp. 89-102, 1994.

Article(s) de conférence(s) internationale(s)

2016 Saïd Jabbour, Yue Ma, Badran Raddaoui, Lakhdar Saïs, Yakoub Salhi, A MIS Partition Based Framework for Measuring Inconsistency in 15th International Conference on Principles of Knowledge Representation and Reasoning (KR’16),AAAI Press, pp. 84-93, 2016.

2016 Abdelhamid Boudane, Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi, A SAT-based Approach for Mining Association Rules in International Joint Conference on Artificial Intelligence (IJCAI-16),juillet 2016.

2016 Saïd Jabbour, Badran Raddaoui, Lakhdar Saïs, Yakoub Salhi, On the Computation of Top-k Extensions in Abstract Argumentation Frameworks in 22th European Conference on Artificial Intelligence (ECAI’16),août 2016.

2015 Saïd Jabbour, Stéphanie Roussel, Lakhdar Saïs, Yakoub Salhi, Mining to Compress Table Constraints in 27th IEEE International Conference on Tools with Artificial Intelligence (ICTAI’15),IEEE Computer Society, pp. 405-412, 2015.

2015 Saïd Jabbour, Yue Ma, Badran Raddaoui, Lakhdar Saïs, Yakoub Salhi, On Structure-Based Inconsistency Measures and Their Computations via Closed Set Packing in AAMAS,pp. 1749-1750, 2015.

2015 Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi, Decomposition Based SAT Encodings for Itemset Mining Problems in PAKDD (2),pp. 662-674, 2015.

2014 Belaid Benhamou, Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi, Symmetry Breaking in Itemset Mining in KDIR,pp. 86-96, 2014.

2014 Mohammad Al-Saedi, Éric Grégoire, Bertrand Mazure, Lakhdar Saïs, Extensions and Variants of Dalal’s Quad Polynomial Fragments of SAT in 26th International Conference on Tools with Artificial Intelligence (ICTAI’14),pp. 446-452, 2014.

2014 Mohammad Al-Saedi, Éric Grégoire, Bertrand Mazure, Lakhdar Saïs, About Some UP-Based Polynomial Fragments of SAT in International Symposium on Artificial Intelligence and Mathematics (ISAIM’14),janvier 2014.

2014 Belaid Benhamou, Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi, A Generic and Declarative Method for Symmetry Breaking in Itemset Mining in Knowledge Discovery, Knowledge Engineering and Knowledge Management - 6th International Joint Conference (IC3K),Springer, pp. 143-160, 2014. (Selected paper)

2014 Saïd Jabbour, Joao Marques-Silva, Lakhdar Saïs, Yakoub Salhi, Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form in JELIA,pp. 152-165, 2014.

2014 Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs, Yakoub Salhi, Extending Modern SAT Solvers for Models Enumeration in 11th IEEE International Conference on Information Reuse and Integration (IRI’14),IEEE Computer Society, pp. 803-810, 2014.

2014 Long Guo, Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs, A Portfolio Based Parallel SAT Solver with Multiple Deletion Strategies in 4th Workshop on Parallel Methods for Constraint Solving (ParSearchOpt’14),juillet 2014.

2014 Long Guo, Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs, Diversification by Clauses Deletion Strategies in Portfolio Parallel SAT Solving in 26th IEEE International Conference on Tools with Artificial Intelligence (ICTAI’14),pp. (to appear), 2014.

2013 Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi, A Pigeon-Hole Based Encoding of Cardinality Constraints in 29th International Conference on Logic Programming (ICLP’13),2013.

2013 Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs, Adding New Bi-Asserting Clauses For Faster Search in Modern SAT Solvers in 10th Symposium on Abstraction, Reformulation, and Approximation (SARA’13),AAAI Press, pp. 66-72, juillet 2013.

2013 Saïd Jabbour, Mehdi Khiari, Lakhdar Saïs, Yakoub Salhi, Karim Tabia, Symmetry-Based Pruning in Itemset Mining in 25th International Conference on Tools with Artificial Intelligence (ICTAI’13),IEEE Computer Society, novembre 2013.

2013 Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi, Top-k Frequent Closed Itemset Mining Using Top-k SAT Problem in European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML/PKDD’13),Springer, vol. 146, pp. 131-140, 2013.

2013 Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi, Boolean Satisfiability for Sequence Mining in 22nd International Conference on Information and Knowledge Management (CIKM’13),ACM Press, pp. 649-658, octobre 2013.

2013 Mohamed Maiza, Lakhdar Saïs, Mohammed Said Radjef, New Lower Bounds for the Variable Sized Bin- Packing Problem with Conflicts in 26th European Conference on Operation Research (EURO-INFORMS’13),juillet 2013.

2013 Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi, Takeaki Uno, Mining-Based Compression Approach of Propositional Formulae in 22nd International Conference on Information and Knowledge Management (CIKM’13),ACM Press, pp. 289-298, octobre 2013.

2013 Yakoub Salhi, Saïd Jabbour, Lakhdar Saïs, Graded Modal Logic GS5 and Itemset Support Satisfiability in Information Search, Integration and Personalization (ISIP’13),Springer, Communications in Computer and Information Science, pp. 131-140, 2013.

2012 Emmanuel Coquery, Jean-Marc Petit, Lakhdar Saïs, Using SAT and SQL for Pattern Miningin Relational Databases in 1st Workshop on COmbining COnstraint solving with MIning and LEarning ({CoCoMile}’12),pp. 41-46, 2012. (dans le cadre d’ECAI’12)

2012 Emmanuel Coquery, Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi, A SAT-Based Approach for Discovering Frequent, Closed and Maximal Patterns in a Sequence in 20th European Conference on Artificial Intelligence (ECAI’12),IOS Press, pp. 258-263, 2012.

2012 Lakhdar Saïs, Mohand-Said Hacid, François Hantry, On the complexity of computing minimal unsatisfiable LTL formulas in Electronic Colloquium on Computational Complexity (ECC),pp. 69, 2012.

2012 Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs, Extending Resolution by Dynamic Substitution of Boolean Functions in 24th International Conference on Tools with Artificial Intelligence (ICTAI’12),IEEE Computer Press, pp. 1029-1034, 2012.

2012 K. Bouchama, Mohammed Said Radjef, Lakhdar Saïs, Calcul d’un Z-équilibre d’un jeu fini : Application à la résolution d’un problème CSP in 9ème Colloque internationale sur l’Optimisation et les Systèmes d’Information (COSI’2012),pp. 74-87, 2012.

2012 Mohamed Maiza, Mohammed Said Radjef, Lakhdar Saïs, Continuous Lower Bound for the Variable Sized Bin-Packing Problem in 9th International Conference on Modeling, Optimization and SIMulation (MOSIM’12),2012. (6 pages)

2012 Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs, Intensification Search in Modern SAT Solvers in 15th International Conference on Theory and Applications of Satisfiability Testing (SAT’12),Springer, Lecture Notes in Computer Science(LNCS), vol. 7962, pp. 491-492, 2012.

2012 Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi, Karim Tabia, Symmetries in Itemset Mining in 20th European Conference on Artificial Intelligence (ECAI ‘12),IOS Press, pp. 432-437, août 2012.

2011 Emmanuel Coquery, Saïd Jabbour, Lakhdar Saïs, A Constraint Programming Approach for Enumerating Motifs in a Sequence in International Workshop on Declarative Pattern Mining (DPM’11),pp. 1091-1097, 2011.

2011 Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Saïs, On freezeing and reactivating learnt clauses in 14th International Conference on Theory and Applications of Satisfiability Testing (SAT’11),Springer, Lecture Notes in Computer Science (LNCS), vol. 6695, pp. 188-200, juin 2011. (Best paper award)

2011 Youssef Hamadi, Saïd Jabbour, Cédric Piette, Lakhdar Saïs, Deterministic Parallel DPLL: System Description in Pragmatics of SAT (POS’11),pp. 127-132, juin 2011. (dans le cadre de SAT’11)

2010 Long Guo, Youssef Hamadi, Saïd Jabbour, Lakhdar Saïs, Diversification and Intensification in Parallel SAT Solving in 16th International Conference on Principles and Practice of Constraint Programming (CP’10),Springer, Lecture Notes in Computer Science (LNCS), vol. 6308, pp. 252-265, septembre 2010.

2010 Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Saïs, Boosting local search thanks to CDCL in 17th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR’10),Springer, Lecture Notes in Computer Science (LNCS), vol. 6397, pp. 474–488, octobre 2010.

2010 Mohamed Baghdadi, Nacéra Benamrane, Lakhdar Saïs, Segmentation of 3D Brain Structures Using the Bayesian Generalized Fast Marching Method in International conference on Brain Informatics (BI’10),Springer, pp. 156-167, août 2010.

2010 Lakhdar Saïs, Portfolio-based Parallel SAT solving in International Conference on High Performance Computing and Simulation (HPCS’10),IEEE Press, pp. 331, juillet 2010.

2009 Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Saïs, Integrating Conflict Driven Clause Learning to Local Search in 6th International Workshop on Local Search Techniques in Constraint Satisfaction (LSCS’09),septembre 2009. (dans le cadre de CP’09)

2009 Youssef Hamadi, Saïd Jabbour, Lakhdar Saïs, Control-Based Clause Sharing in Parallel SAT Solving in 21st International Joint Conference on Artificial Intelligence (IJCAI’09),pp. 499-504, juillet 2009.

2009 Youssef Hamadi, Saïd Jabbour, Lakhdar Saïs, Learning for Dynamic Subsumption in 21st International Conference on Tools with Artificial Intelligence (ICTAI’09),IEEE Computer Society, pp. 328-335, novembre 2009. (Best paper award)

2009 Éric Grégoire, Bertrand Mazure, Lakhdar Saïs, Local autarkies searching for the dynamic partition of CNF formulae in 21st International Conference on Tools with Artificial Intelligence (ICTAI’09),IEEE Computer Society, pp. 107-114, novembre 2009.

2009 Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Saïs, Learning in local search in 21st International Conference on Tools with Artificial Intelligence (ICTAI’09),IEEE Computer Society, pp. 417-424, novembre 2009.

2009 Dominique D’Almeida, Lakhdar Saïs, Enhancing Neighbourhood Substitutability Thanks to Singleton Arc Consistency in 21st International Conference on Tools with Artificial Intelligence (ICTAI’09),IEEE Computer Society, pp. 91-98, novembre 2009.

2009 Cédric Piette, Youssef Hamadi, Lakhdar Saïs, Efficient Combination of Decision Procedure for MUS Computation in 7th International Symposium on Frontiers of Combining Systems (FroCos’09),Springer, Lecture Notes in Computer Science (LNCS), vol. 5749, pp. 335-349, septembre 2009. [Download]

2008 Assef Chmeiss, Vincent Krawczyk, Lakhdar Saïs, Redundancy in CSPs in 18th European Conference on Artificial Intelligence (ECAI’08),pp. 907-908, juillet 2008.

2008 Cédric Piette, Youssef Hamadi, Lakhdar Saïs, Vivifying propositional clausal formulae in 18th European Conference on Artificial Intelligence (ECAI’08),pp. 525-529, juillet 2008. [Download]

2008 Gilles Audemard, Lucas Bordeaux, Youssef Hamadi, Saïd Jabbour, Lakhdar Saïs, A generalized Framework For Conflict Analysis in 11th International Conference on Theory and Applications of Satisfiability Testing (SAT’08),Springer, Lecture Notes in Computer Science (LNCS), vol. 4996, pp. 21–27, mai 2008.

2007 Christophe Lecoutre, Lakhdar Saïs, Sébastien Tabary, Vincent Vidal, Transposition Tables for Constraint Satisfaction in 22nd Conference on Artificial Intelligence (AAAI’07),pp. 243-248, juillet 2007. [Download]

2007 Lionel Paris, Richard Ostrowski, Lakhdar Saïs, Pierre Siegel, From Horn Strong Backdoor Sets to Ordered Strong Backdoor Sets in 7th Mexican International Conference on Artificial Intelligence (MICAI’08),pp. 105?117, 2007.

2007 Gilles Audemard, Saïd Jabbour, Lakhdar Saïs, Symmetry Breaking in Quantified Boolean Formulae in International Joint Conference on Artificial Intelligence (IJCAI’2007),pp. 2262–2267, janvier 2007. [Download]

2007 Gilles Audemard, Lakhdar Saïs, Circuit Based Encoding of CNF Formula in Tenth International Conference on Theory and Applications of Satisfiability Testing (SAT’07),LNCS 4501, Springer Verlag, pp. 16–21, mai 2007.

2007 Assef Chmeiss, Vincent Krawczyk, Lakhdar Saïs, Light Integration of Path Consistency for Solving CSPs in 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI’07),pp. 263-266, octobre 2007.

2007 Olivier Fourdrinoy, Éric Grégoire, Bertrand Mazure, Lakhdar Saïs, Eliminating Redundant Clauses in Sat Instances in The Fourth International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR’07),Lecture Notes in Computer Science (LNCS 4510), Springer, pp. 71-83, mai 2007. (lncs 4510)

2007 Olivier Fourdrinoy, Éric Grégoire, Bertrand Mazure, Lakhdar Saïs, Reducing hard SAT instances to polynomial ones in the 2007 IEEE international conference on Information Reuse and Integration (IEEE-IRI’07),pp. 18-23, août 2007.

2007 Dominique D’Almeida, Jean-François Condotta, Christophe Lecoutre, Lakhdar Saïs, Relaxation of Qualitative Constraint Networks in 7th Symposium on Abstraction, Reformulation and Approximation (SARA’07),LNCS 4612, Springer, pp. 93-108, juillet 2007. [Download]

2007 Christophe Lecoutre, Lakhdar Saïs, Sébastien Tabary, Vincent Vidal, Nogood Recording from Restarts in Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI’2007),pp. 131-136, janvier 2007. [Download]

2007 Christophe Lecoutre, Lakhdar Saïs, Sébastien Tabary, Vincent Vidal, Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance in 13th International Conference on Principles and Practice of Constraint Programming (CP’07),LNCS 4741, Springer, pp. 453-467, septembre 2007. [Download]

2007 Gilles Audemard, Saïd Jabbour, Lakhdar Saïs, Efficient Symmetry breaking Predicates for quantified boolean formulae in Workshop on Symmetry and Constraint Satisfaction Problems - Affiliated to CP (SymCon),septembre 2007.

2007 Gilles Audemard, Saïd Jabbour, Lakhdar Saïs, Using SAT-Graph representation to derive hard instances in 14th RCRA workshop Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA’07),juillet 2007.

2006 Christophe Lecoutre, Lakhdar Saïs, Sébastien Tabary, Vincent Vidal, Last Conflict based Reasoning in Proceedings of the 17th European Conference on Artificial Intelligence (ECAI’2006),pp. 133-137, août 2006. [Download]

2006 Fred Hemery, Christophe Lecoutre, Lakhdar Saïs, Frédéric Boussemart, Extracting MUCs from Constraint Networks in 17th European Conference on Artificial Intelligence (ECAI’06),pp. 113-117, août 2006. [Download]

2006 Christophe Lecoutre, Lakhdar Saïs, Julien Vion, Using SAT Encodings to derive CSP value ordering heuristics in International Workshop on the Integration of SAT and CP techniques held with CP’06 (SATCP’06),pp. 33-47, septembre 2006.

2006 É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, septembre 2006.

2006 Lionel Paris, Richard Ostrowski, Lakhdar Saïs, Pierre Siegel, Computing Horn Strong Backdoor Sets Thanks to Local Search in 8th International Conference on Tools with Artificial Intelligence (ICTAI’06),pp. 13–15, novembre 2006.

2006 Assef Chmeiss, Lakhdar Saïs, About look-ahead algorithms in Constraint Satisfaction Problems in 2nd IEEE International Conference on Information Technologies: from Theory to Applications (ICTTA’06),vol. 2, pp. 3492 - 3497 , avril 2006.

2006 Jean-François Condotta, Dominique D’Almeida, Christophe Lecoutre, Lakhdar Saïs, From Qualitative to Discrete Constraint Networks in International Workshop on Qualitative Constraint Calculi held with KI’06 (QCC’06),pp. 54-64, juin 2006. [Download]

2006 Christophe Lecoutre, Lakhdar Saïs, Sébastien Tabary, Vincent Vidal, Nogood Recording from Restarts in International Workshop on the Integration of SAT and CP techniques held with CP’06 (SATCP’06),pp. 97-111, septembre 2006.

2005 Éric Grégoire, Richard Ostrowski, Bertrand Mazure, Lakhdar Saïs, Automatic extraction of functional dependencies in Theory and Applications of Satisfiability Testing: 7th International Conference (SAT 2004), Revised Selected Papers,LNCS 3542, pp. 122-132, 2005.

2005 Sylvain Darras, Gilles Dequen, Laure Devendeville, Bertrand Mazure, Richard Ostrowski, Lakhdar Saïs, Using Boolean Constraint Propagation for Sub-clause Deduction in Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming (CP’05),LNCS 3709, Springer Verlag, pp. 757-761, octobre 2005.

2005 Gilles Audemard, Lakhdar Saïs, Une approche Symbolique pour les Formules Booléennes Quantifiées in Actes du Colloque sur l?Optimisation et les Systèmes d?Informations (COSI’05),pp. 285-296, 2005.

2005 Olivier Fourdrinoy, Éric Grégoire, Bertrand Mazure, Lakhdar Saïs, Exploring Hybrid Algorithms for SAT in Proceedings of the 12th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR?2005) (short papers),pp. 33-37, decembre 2005. (short paper)

2005 Gilles Audemard, Lakhdar Saïs, A Symbolic Search Based Approach for Quantified Boolean Formulas in Proceedings of the 8th International Conference on Theory and Applications of Satisfiability Testing (SAT’05), LNCS 3569, Springer Verlag, pp. 16-30, 2005.

2004 Assef Chmeiss, Lakhdar Saïs, Constraint Satisfaction Problems : Backtrack Search Revisited in Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI’04),pp. 252-257, novembre 2004.

2004 Gilles Audemard, Lakhdar Saïs, SAT Based BDD Solver for Quantified Boolean Formulas in 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI’04), IEEE Computer Society, pp. 82 - 89, septembre 2004.

2004 Frédéric Boussemart, Fred Hemery, Christophe Lecoutre, Lakhdar Saïs, Boosting systematic search by weighting constraints in 16th European Conference on Artificial Intelligence (ECAI’04),pp. 146-150, août 2004. [Download]

2004 Gilles Audemard, Bertrand Mazure, Lakhdar Saïs, Dealing with Symmetries in Quantified Boolean Formulas in Proc. of the Seventh International Conference on Theory and Applications of Satisfiability Testing,pp. 257-262, 2004.

2004 Frédéric Boussemart, Fred Hemery, Christophe Lecoutre, Lakhdar Saïs, Support inference for generic filtering in 10th International Conference on Principles and practice of Constraint Programming (CP’04),LNCS 3258, Springer, pp. 721-725, septembre 2004. [Download]

2003 Richard Ostrowski, Bertrand Mazure, Lakhdar Saïs, Éric Grégoire, Eliminating redundancies in SAT search trees in Proc. of the 15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI’2003),pp. 100-104, novembre 2003.

2003 Assef Chmeiss, Lakhdar Saïs, About Neighborhood Substitutability in CSPs in Proceedings of the Third International Workshop on Symmetry in Constraint Satisfaction problems (SymCon’2003),pp. 41-45, septembre 2003.

2002 Richard Ostrowski, Éric Grégoire, Bertrand Mazure, Lakhdar Saïs, Recovering and exploiting structural knowledge from CNF formulas in Proc. of the Eighth International Conference on Principles and Practice of Constraint Programming (CP’2002),LNCS 2470, Springer Verlag, pp. 185-199, septembre 2002.

2002 Richard Ostrowski, Bertrand Mazure, Lakhdar Saïs, LSAT solver in Fifth International Symposium on the Theory and Applications of Satisfiability Testing (SAT 2002),mai 2002. (SAT solvers description)

2002 Éric Grégoire, Bertrand Mazure, Lakhdar Saïs, Using failed local search for SAT as an oracle for tackling harder A.I. problems more efficiently in Proc. of the Tenth International Conference on Artificial Intelligence : Methodology, Systems, Applications (AIMSA’2002),LNCS 2443, Springer Verlag, pp. 51-60, septembre 2002.

2001 Christian Bessiere, Assef Chmeiss, Lakhdar Saïs, Neihborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem in Proc. of the 7th International Conference on Principles and Practice of Constraint Programming (CP-01),LNCS 2239, Springer Verlag, pp. 565-569, novembre 2001.

2000 Assef Chmeiss, Lakhdar Saïs, About the use of local consistency in solving CSPs in Proc. of the Twelfth IEEE Intl. Conf. on Tools with Artificial Intelligence - ICTAI’00,IEEE Computer Press, pp. 104-107, novembre 2000.

2000 Éric Grégoire, Lakhdar Saïs, Modelling and checking complex discrete critical systems in Proceedings of the International Conference on Modelling and Simulation - MS’00,pp. 233-240, septembre 2000.

1999 Laure Brisoux, Éric Grégoire, Lakhdar Saïs, Improving backtrack search for SAT by means of redundancy in Proceedings of the 11th International Symposium on Methodologies for Intelligent Systems - ISMIS’99,LNCS 1609, Springer Verlag, pp. 301-309, juin 1999.

1998 Bertrand Mazure, Lakhdar Saïs, Éric Grégoire, System Description: CRIL Platform for SAT in Proc. of the 15th Intl. Conf. on Automated Deduction (CADE-15),LNCS 1421, Springer Verlag, pp. 124-128, juillet 1998.

1998 Éric Grégoire, Bertrand Mazure, Lakhdar Saïs, Logically-complete local search for propositional nonmonotonic knowledge bases in Proc. of the 7th Intl. Workshop on Nonmonotonic Reasoning (NMR-98),pp. 37-45, juin 1998.

1998 Laure Brisoux, Lakhdar Saïs, Éric Grégoire, Validation of knowledge-based systems by means of stochastic search in Proceedings of the DEXA Workshop on Verification, Validation and Integrity Issues in Expert and Database Systems,IEEE Computer Press, pp. 41-46, septembre 1998.

1998 Brigitte Bessant, Éric Grégoire, Pierre Marquis, Lakhdar Saïs, Syntax-based belief revision through local search in Proceedings of the International Workshop on Belief Revision,juin 1998.

1998 Brigitte Bessant, Éric Grégoire, Pierre Marquis, Lakhdar Saïs, Combining nonmonotonic reasoning and belief revision: a practical approach in Proc. 8th Intl. Conf. on Artificial Intelligence Methodology, Systems, Applications (AIMSA-98),LNCS 1480, Springer Verlag, pp. 115-128, septembre 1998. (Best Paper Award)

1997 Yacine Boufkhad, Éric Grégoire, Pierre Marquis, Bertrand Mazure, Lakhdar Saïs, Tractable cover compilations in Proc. of the 15th Intl. Joint Conf. on Artificial Intelligence (IJCAI-97),pp. 122-127, août 1997.

1997 Bertrand Mazure, Lakhdar Saïs, Éric Grégoire, Checking Several Forms of Consistency in Nonmonotonic Knowledge-Bases in Proceedings International Joint Conference on Qualitative and Quantitative Practical Reasoning,LNAI 1244, Springer Verlag, pp. 122-130, juin 1997.

1997 Bertrand Mazure, Lakhdar Saïs, Éric Grégoire, A comparison of two approaches to inconsistency detecting in Proceedigns of the European Symposium on Intelligent Techniques (ESIT’97),mars 1997.

1997 Bertrand Mazure, Lakhdar Saïs, Éric Grégoire, Local search for computing normal circumstances models in Proceedings oh the International Conference on Computational Intelligence (ICCI’97),LNCS 1226, Springer Verlag, pp. 55-56, avril 1997.

1997 Bertrand Mazure, Lakhdar Saïs, Éric Grégoire, Tabu Search for SAT in Proc. of the 14th Nat. Conf. on Artificial Intelligence (AAAI-97),pp. 281-285, juillet 1997.

1996 Lakhdar Saïs, SAT : Experiments meet Theory in Proceedings of the ECAI-96 Workshop on Experimental Artificial Intelligence,août 1996.

1996 J. Crawford, Lakhdar Saïs, Symmetries in Proceedings of the First International Competition and Symposium on Satisfiability Testing,mars 1996.

1996 Bertrand Mazure, Lakhdar Saïs, Éric Grégoire, SUN : a Multistrategy Platform for SAT in Proc. First Int. Competition and Symposium on Satisfiability Testing,mars 1996. (SAT solvers description)

1996 Bertrand Mazure, Lakhdar Saïs, Éric Grégoire, Detecting Logical Inconsistencies in Proc. AI and Maths Symposium,pp. 116-121, janvier 1996.

1996 Éric Grégoire, Lakhdar Saïs, Inductive Reasoning is Sometimes Deductive in Proceedings of the ECAI-96 Workshop on Abductive and Inductive Reasoning,pp. 36-39, août 1996.

1996 Bertrand Mazure, Lakhdar Saïs, Éric Grégoire, A Powerful Heuristic to Locate Inconsistent Kernels in Knowledge-Based Systems in Proc. Int. Conf. on Inform. Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU-96),pp. 1265-1269, juillet 1996.

1995 Bertrand Mazure, Lakhdar Saïs, Éric Grégoire, TWSAT : a new local search algorithm for SAT : performance and analysis in Proc. CP-Workshop on Solving Really Hard Problems,pp. 127-130, septembre 1995.

1994 Lakhdar Saïs, Finding Non Isomorphic Solutions in Proceedings of the 6th International Conference on AI : Methodology, Systems and Applications - AIMSA’94,septembre 1994.

1994 Lakhdar Saïs, Characterization of the set of models by means of symmetries in Proceedings of the Second Workshop on the Principles and Pratice of Constraint Programming PPCP-94,mai 1994.

1994 Belaid Benhamou, Lakhdar Saïs, Two proof procedures of cardinality based language in propositional calculus in Proceedings of the 11th International Symposium on Theoretical Aspects of Computer Science - STACS’94,Springer, vol. 775 , pp. 71-82, février 1994.

1994 Lakhdar Saïs, R. Génisson, Towards an Understanding of Hard Satisfiability Problems in Proceedings of the CADE-12 Workshop on Evaluation of Automated Theorem Proving,pp. 24-29, 1994.

1994 Lakhdar Saïs, R. Génisson, Some Ideas on Random Generation of K-Sat Instance in Proceedings of the AAAI-94 Workshop on Experimental Evaluation of Reasoning and Search Methods,pp. 91-93, juillet 1994.

1994 Lakhdar Saïs, A Computational Study of DP with Symmetry on Hard Satisfiability Problems in Proceedings of the AAAI-94 Workshop on Experimental Evaluation of Reasoning and Search Methods,pp. 52-56, juillet 1994.

Article(s) de revue(s) nationale(s)

2014 Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs, Clémentin Tayou Djamegni, Resolution Etendue par Substitution Dynamique des Fonctions Booleennes in Revue d’intelligence artificielle (RIA),2014. (to appear)

2011 Saïd Jabbour, Lakhdar Saïs, Symétries et QBF in Revue d’Intelligence Artificielle (RIA),vol. 26, n° 1-2, Hermes, pp. 813-835, 2011.

Article(s) de conférence(s) nationale(s)

2014 Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs, Yakoub Salhi, Autours des Strategies de Reduction de la Base de Clauses Apprises. in 10èmes Journées Francophones de Programmation par Contraintes (JFPC’14),juin 2014.

2014 Saïd Jabbour, Mehdi Khiari, Lakhdar Saïs, Yakoub Salhi, Karim Tabia, Symétries et Extraction de Motifs Ensemblistes in EGC,pp. 407-418, 2014.

2014 Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs, Nouvelles Clauses Bi-Assertives et leurs Int?gration dans les Solveurs SAT Modernes in 10èmes Journées Francophones de Programmation par Contraintes (JFPC’14),juin 2014.

2013 Long Guo, Saïd Jabbour, Lakhdar Saïs, Stratégies d’élimination des clauses apprises dans les solveurs SAT modernes in 9ièmes Journées Francophones de Programmation par Contraintes (JFPC’13),pp. 147-156, 2013.

2012 Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs, Resolution Etendue par Substitution Dynamique des Fonctions Booleennes in 8eme Journées Francophones de Programmation par Contraintes (JFPC’12),pp. 146-155, mai 2012.

2012 Lakhdar Saïs, Jean-Marc Petit, Lhouari Nourine, Approches déclaratives pour l’énumération de motifs intéressants in 8ièmes Journées Francophones de Programmation par Contraintes (JFPC’12),pp. 4, 2012.

2012 Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs, Intensification Search in Modern SAT Solvers in 8ièmes Journées Francophones de Programmation par Contraintes (JFPC’12),pp. 156-159, mai 2012.

2011 Youssef Hamadi, Saïd Jabbour, Cédric Piette, Lakhdar Saïs, Concilier Parallélisme et Déterminisme dans la Résolution de SAT in 7ièmes Journées Francophones de la Programmation par Contraintes (JFPC’11),pp. 163-172, juin 2011.

2009 Dominique D’Almeida, Lakhdar Saïs, Recherche de la substituabilité par l’arc-cohérence de singleton in 5ièmes Journées Francophones de Programmation par Contraintes (JFPC’09),pp. 385-394, juin 2009.

2009 Youssef Hamadi, Saïd Jabbour, Lakhdar Saïs, Réordonnancement dynamique basé sur l’apprentissage in 5ièmes Journées Francophones de la Programmation par Contraintes (JFPC’09),pp. 295-304, juin 2009.

2009 Youssef Hamadi, Saïd Jabbour, Lakhdar Saïs, Subsumption dirigée par l’analyse de conflits in 5ièmes Journées Francophones de la Programmation par Contraintes (JFPC’09),pp. 105-114, juin 2009.

2009 Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Saïs, Analyse de conflits dans le cadre de la recherche locale in 5ièmes Journées Francophones de la Programmation par Contraintes (JFPC’09),pp. 215-224, juin 2009. [Download]

2008 Assef Chmeiss, Vincent Krawczyk, Lakhdar Saïs, La redondance dans les CSPs in 4ièmes Journées Francophones de Programmation par Contraintes (JFPC’08),pp. 173-180, juin 2008.

2008 Gilles Audemard, Lucas Bordeaux, Youssef Hamadi, Saïd Jabbour, Lakhdar Saïs, Un cadre général pour l’analyse des conflits in 4ièmes Journées Francophones de Programmation par Contraintes (JFPC’08),pp. 267–276, juin 2008. [Download]

2008 Cédric Piette, Youssef Hamadi, Lakhdar Saïs, Vivification de formules propositionnelles clausales in 4ièmes Journées Francophones de Programmation par Contraintes (JFPC’08),pp. 277-286, juin 2008.

2008 Olivier Fourdrinoy, Éric Grégoire, Bertrand Mazure, Lakhdar Saïs, Réduction d’instances de SAT vers des instances polynomiales in 16ième congrès francophone Reconnaissance des Formes et Intelligence Artificielle (RFIA’08),pp. 388-396, janvier 2008.

2007 Olivier Fourdrinoy, Éric Grégoire, Bertrand Mazure, Lakhdar Saïs, Suppression des clauses redondantes dans des instances SAT in 3èmes Journées Francophones de Programmation par Contraintes (JFPC’07),pp. 28-37, juin 2007.

2007 Christophe Lecoutre, Lakhdar Saïs, Sébastien Tabary, Vincent Vidal, Tables de transposition pour la satisfaction de contraintes in 3èmes Journées Francophones de Programmation par Contraintes (JFPC’07),pp. 223-230, juin 2007. [Download]

2006 Olivier Fourdrinoy, Éric Grégoire, Bertrand Mazure, Lakhdar Saïs, Heuristique d’ordonnancement des variables pour SAT in Congrès de la Société Française de Recherche Opérationelle et d’Aide à la Décision (ROADEF’06),janvier 2006.

2006 Christophe Lecoutre, Lakhdar Saïs, Sébastien Tabary, Vincent Vidal, Recherche dirigee par le dernier conflit in 2ndes Journées Francophones de Programmation par Contraintes (JFPC’06),pp. 257-266, juin 2006. [Download]

2006 Fred Hemery, Christophe Lecoutre, Lakhdar Saïs, Frédéric Boussemart, Extraction de noyaux insatisfiables minimaux de reseaux de contraintes in 2ndes Journées Francophones de Programmation par Contraintes (JFPC’06),pp. 209-217, juin 2006. [Download]

2006 Lionel Paris, Richard Ostrowski, Lakhdar Saïs, Pierre Siegel, Approximation d’ensembles Horn strong backdoor par recherche locale in 2ndes Journées Francophones de Programmation par Contraintes (JFPC’06),pp. 277-284, juin 2006.

2006 Gilles Audemard, Saïd Jabbour, Lakhdar Saïs, Exploitation des symétries dans les formules booléennes quantifiées in 2ndes Journées Francophones de Programmation par Contraintes (JFPC’06),pp. 257–266, juin 2006.

2005 Sylvain Darras, Gilles Dequen, Laure Devendeville, Bertrand Mazure, Richard Ostrowski, Lakhdar Saïs, Utilisation de la Propagation de Contraintes pour la Production de Sous-Clauses in Premières Journées Francophones de la Programmation par Contraintes (JFPC’05),pp. 69-78, juin 2005.

2005 Assef Chmeiss, Lakhdar Saïs, De FC a MAC : un Algorithme Paramétrable pour la Résolution de CSP in Premières Journées Francophones de la Programmation par Contraintes (JFPC’05),pp. 267-276, juin 2005.

2005 Frédéric Boussemart, Fred Hemery, Christophe Lecoutre, Lakhdar Saïs, Inférence de supports pour les algorithmes de filtrage générique in 1ères Journées Francophones de Programmation par Contraintes (JFPC’05),pp. 89-98, juin 2005. [Download]

2005 Gilles Audemard, Lakhdar Saïs, Une approche symbolique pour les formules booléennes quantifiées in Premières Journées Francophones de la Programmation par Contraintes (JFPC’05),pp. 59-68, juin 2005.

2005 Éric Grégoire, Bertrand Mazure, Richard Ostrowski, Lakhdar Saïs, Dépendances Fonctionnelles Booléennes : Détection et Exploitation in Colloque sur l’Optimisation et les Systèmes d’Information (COSI’05),pp. 263-274, 2005.

2004 Frédéric Boussemart, Fred Hemery, Christophe Lecoutre, Lakhdar Saïs, Heuristiques de choix de variables dirigées par les conflits in 10èmes Journées Nationales sur la résolution pratique des Problèmes NP-Complets (JNPC’04),pp. 91-105, juin 2004. [Download]

2004 Richard Ostrowski, Bertrand Mazure, Lakhdar Saïs, Éric Grégoire, Elimination des redondances dans les algorithmes de résolution de SAT in Actes du Quatorzième Congrès Francophone AFRIF-AFIA sur la Reconnaissance des Formes et l’Intelligence Artificielle (RFIA-2004),vol. 3, pp. 1343-1350, janvier 2004.

2004 Gilles Audemard, Bertrand Mazure, Lakhdar Saïs, Symétries et Formules Booléennes Quantifiées in Journées Nationales de la Résolution Pratique des Problèmes {NP}-Complets (JNPC),pp. 43 - 53, 2004.

2004 Éric Grégoire, Richard Ostrowski, Bertrand Mazure, Lakhdar Saïs, Déduction Automatique de Dépendances fonctionnelles in Dixièmes Journées Nationales sur la résolution Pratique de Problèmes NP-Complets (JNPC 2004),pp. 171-180, juin 2004.

2002 Richard Ostrowski, Éric Grégoire, Bertrand Mazure, Lakhdar Saïs, Techniques de simplification de CNF in Actes des 8èmes Journées Nationales sur la Résolution Pratique des Problèmes NP-complets (JNPC-02),pp. 181-194, mai 2002.

2001 Christian Bessiere, Assef Chmeiss, Lakhdar Saïs, Heuristiques multi-niveaux pour ordonner les variables dans les CSP in Actes des 7ème journées Nationales sur la résolution Pratique des problèmes NP-Complets (JNPC’2001),pp. 49-60, juin 2001.

2000 Laure Brisoux, Lakhdar Saïs, Éric Grégoire, Recherche locale : vers une exploitation des propriétés structurelles in Actes des Sixièmes Journ. Nat. sur la Résolution Pratique des Problèmes NP-complets (JNPC-00),pp. 243-244, juin 2000.

1999 A. Rauzy, Lakhdar Saïs, Laure Brisoux, Calcul propositionnel : vers une extension du formalisme in Actes des Cinquièmes Journées Nationales sur la Résolution Pratique des Problèmes NP-Complets (JNPC-99),pp. 189-198, juin 1999.

1998 Laure Brisoux, Lakhdar Saïs, Éric Grégoire, Mieux exploiter les échecs au sein des arbres de recherche à la Davis et Putnam in Actes des Quatrièmes Journ. Nat. sur la Résolution Pratique des Problèmes NP-complets (JNPC-98),pp. 31-39, mai 1998.

1996 Bertrand Mazure, Lakhdar Saïs, Éric Grégoire, Deux approches pour la résolution du problème SAT in Actes de la deuxième Conférence Nationale sur la Résolution Pratique des Problèmes NP-complets (CNCP-96),Teknéa Editions, pp. 103-114, mars 1996.

Actes de conférence(s)

2008 Lakhdar Saïs, Colloque sur l’Optimisation et les Systèmes d’Information (COSI’05) Sais Lakhdar and Nourine Lhouari and Meziane Aider (Eds.), juin 2008.

2008 Lakhdar Saïs, Workshop on Symmetry and Constraint Satisfaction Problems - Affiliated to CP (SymCon) Fadi Alloul and Belaid benhamou and Lakhdar Sais (Eds.), 2008.

2007 Lakhdar Saïs, Colloque sur l’Optimisation et les Systèmes d’Information (COSI’09) Sais Lakhdar and Nourine Lhouari (Eds.), juin 2007.

2005 Lakhdar Saïs, 1ères Journées Francophones de Programmation par Contraintes (JFPC’05) Sais Lakhdar (Eds.), 2005.

1998 Lakhdar Saïs, 4èmes Journées Nationales sur la résolution pratique des problèmes NP-complets (JNPC’98) Sais Lakhdar (Eds.), mai 1998.

Ouvrage(s)

2008 Lakhdar Saïs, Problème SAT : Progrès et Défis Lakhdar SAIS (Eds.), Hermes, Londres, 2008. (352 pages) [Download]

Chapitre(s) d'ouvrage(s)

2012 Youssef Hamadi, Saïd Jabbour, Lakhdar Saïs, Control-based clause sharing in Parallel SAT in Autonomous Search,chapitre 10, pp. 245-267, Y. Hamadi, E. Monfroy, F. Saubion (Eds.), Springer, 2012.

2012 Maroua Bouzid, Laurence Cholvy, Didier Dubois, L Garcia, Sébastien Konieczny, Florence Le Ber, G. Ligozat, Pierre Marquis, Pascal Nicolas, Odile Papini, Henri Prade, Lakhdar Saïs, Intelligence Artificielle Fondamentale : Ses contours généraux et un aperçu de quelques problématiques importantes Cépuades, 2012.

2008 Olivier Dubois, Lakhdar Saïs, Bilan et défis in SAT : progrès et défis,chapitre 12, pp. 311-318, Hermes, Londres, 2008.

2001 Brigitte Bessant, Éric Grégoire, Pierre Marquis, Lakhdar Saïs, Iterated Syntax-Based Revision in a Nonmonotonic Setting in Frontiers in Belief Revision,vol. 22, pp. 369-391, Williams M.-A. et Rott H. (Eds.), Kluwer Academic Publishers, 2001.

1998 Éric Grégoire, Lakhdar Saïs, Practical Inconsistency Management for Critical-Tasks Decision Support Systems in Fuzzy Logic and Intelligent Technologies for Nuclear Science and Industry,pp. 384-391, Ruan D. (ed.) (Eds.), World Scientific, Singapour, 1998.

Thèse(s) de doctorat

1993 Lakhdar Saïs, Etude des symétries et de la cardinalité en calcul propositionnel: Applications aux algorithmes sémantiques France, février 1993.

Habilitation(s) à Diriger des Recherches

2000 Lakhdar Saïs, De la résolution du problème SAT à la résolution de problèmes autour de SAT CRIL, Lens, France, decembre 2000.

Rapport(s) technique(s)

2015 Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi, On SAT Models Enumeration in Itemset Mining in CoRR,ARXIV, 2015. [Download]

2014 Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs, Yakoub Salhi, Revisiting the Learned Clauses Database Reduction Strategies in CoRR,ARXIV, 2014. [Download]

2014 Saïd Jabbour, Yue Ma, Badran Raddaoui, Lakhdar Saïs, Yakoub Salhi, On the measure of conflicts: A MUS-Decomposition Based Framework in CoRR,ARXIV, 2014. [Download]

2013 Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi, A Mining-Based Compression Approach for Constraint Satisfaction Problems arxiv, mai 2013. [Download]

2011 Youssef Hamadi, Saïd Jabbour, Cédric Piette, Lakhdar Saïs, Deterministic Parallel (DP)2LL Microsoft Research Cambridge, avril 2011. [Download]

2010 Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Saïs, RCL: Reduce learnt clauses Proceedings of SAT Race 2010: Solver and Benchmarks Descriptions, Edinburgh, Scotland, UK, juillet 2010.

2010 Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Saïs, SatHYS: Sat Hybrid Solver Proceedings of SAT Race 2010: Solver and Benchmarks Descriptions, Edinburgh, Scotland, UK, juillet 2010.

2008 Cédric Piette, Youssef Hamadi, Lakhdar Saïs, preSAT: SAT Solver Description CRIL, avril 2008. [Download]

2003 Richard Ostrowski, Bertrand Mazure, Lakhdar Saïs, LSAT Solver v2.0 in Manuel Technique : description du solveur soumis à la compétition SAT’03,2003.

2002 Richard Ostrowski, Éric Grégoire, Bertrand Mazure, Lakhdar Saïs, Recovering and exploiting structural knowledge from CNF formulas Lens, France, avril 2002.