Lakhdar SAIS' home page

• Home
• Research
• Publications
• Teaching
• Links
• Personal

 

 

 

Publications

2011| 2011|2010|2009 | 2008 | 2007 | 2006 | 2005 | 2004 | 2003 | 2002 | 2001 | 1991-2000

DBLP:Lakhdar Sais

2012

• Said Jabbour, and Lakhdar Sais Symmétries et QBF. RSTI -RIA -26/2012. Intelligence artificielle fondamentale, pages 103-125, 2012.

2011

• Youssef Hamadi, Said Jabbour, and Lakhdar Sais Learning from Conflicts in Propositional Satisfiability. A Quarterly Journal of Operations Research (4OR), (To appear) 2011.

• Emmanuel Coquery, Said Jabbour, and Lakhdar Sais A Constraint Programming Approach for Enumerating Motifs in a Sequence. In proceedings of the International Workshop on Declarative Pattern Mining (DPM'2011 held in conjunction with IEEE-ICDM'2011). December 11-14, 2011, Vancouver, Canada, (to appear), 2011.

• Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais On freezeing and reactivating learnt clauses. Fourteenth International Conference on Theory and Applications of Satisfiability Testing (SAT'11), LNCS, Springer, pages 188-200, Ann Arbor, USA, June 2011 ( Best paper award ).

• Youssef Hamadi, Said Jabbour, Cédric Piette, and Lakhdar Sais Deterministic Parallel DPLL: System Description. Int. Journal on Satisfiability, Boolean Modeling and Computation (JSAT), (to appear), 2011.

• Youssef Hamadi, Said Jabbour, and Lakhdar Sais Control-Based Clause Sharing in Parallel SAT Solving. Chapter in Autonmous Search book, Hamadi, Y.; Monfroy, E.; Saubion, F. (eds.), Springer, pages 247-269, (to appear) novembre 2011.

• Jean-Marie Lagniez, Gilles Audemard, Bertrand Mazure, Lakhdar Sais Vers une gestion fine et dynamique de la base de clauses apprisesVers une gestion fine et dynamique de la base de clauses apprises. Actes des 7eme Journées Francophones de Programmation par Contraintes (JFPC'2011), Lyon, 8-10 juin 2011 Journées , 2011.

• Youssef Hamadi, Said Jabbour, Cédric Piette, and Lakhdar Sais Concilier Parallélisme et Déterminisme dans la Résolution de SAT. Actes des 7eme Journées Francophones de Programmation par Contraintes (JFPC'2011), Lyon, 8-10 juin 2011

2010

• Mohamed Baghdadi, Nacéra Benamrane, Lakhdar Sais Segmentation of 3D Brain Structures Using the Bayesian Generalized Fast Marching Method. International Conference on Brain Informatics 2010, LNCS, Springer, pages 156-167, Toronto, Canada, August 28-30 2010.

• Long Guo, Youssef Hamadi, Said Jabbour, Lakhdar Sais Diversification and Intensification in Parallel SAT Solving. International Conference on Principles and Practice of Constraint Programming - CP 2010, LNCS, Springer, pages 252-265, St. Andrews, Scotland, UK, September 6-10 2010.

• Lakhdar Sais Portfolio-based Parallel SAT solving. IEEE-International Conference on International Conference on High Performance Computing and Simulation - HPCS 2010, LNCS, Springer, pages 331, Caen, June 28 - July 2, 2010.

• Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais Boosting Local Search Thanks to CDCL. International Conference on Logic for Programming, Artificial Intelligence, and Reasoning - LPAR 2010, LNCS, Springer, pages 474-488, Yogyakarta, Indonesia, October 10-15, 2010 Caen.

• Youssef Hamadi, Said Jabbour, Lakhdar Sais Learning for Dynamic Subsumption. International Journal on Artificial Intelligence Tools 19(4): 511-529 (2010)

2009

• Lecoutre Christophe, Sais Lakhdar, Tabary Sebastien and Vidal Vincent. Reasoning from Last Conflict(s) in Constraing Programming. Artificial Intelligence Journal, 2009 (to appear).

• Y. Hamadi, S. Jabbour, and L. Sais. ManySAT: a parallel SAT solver. In Journal on Satisfiability, Boolean Modeling and Computation, JSAT, Volume 6, Special Issue on Parallel SAT, pages 245-262, IOS Press, 2009.

• Y. Hamadi, S. Jabbour, and L. Sais. Control-Based Clause Sharing in Parallel SAT Solving, In twenty-first International Joint Conference on Artificial Inteligence (IJCAI-09), pages 499-504; Pasadena, California, July 11-17, 2009.

• Cédric Piette, Youssef Hamadi, Lakhdar Sais. Efficient Combination of Decision Procedures for MUS Computation. In 7th International Symposium on Frontiers of Combining Systems, FroCoS 2009, pages 335-349, LNCS, volume 5749, springer, Trento, Italy, September 16-18, 2009.

• D. D'Almaida and L. Sais.Enhancing Neighborhood Substitutability Thanks to Singleton Arc Consistency. In twenty-first IEEE International Conference on Tools with Artificial Intelligence. In twenty-first International Joint Conference on Artificial Inteligence (ICTAI-09), Newark, New Jersey, November 2-5, 2009.

• Eric Gregoire, Bertrand Mazure, Lakhdar Sais.Local autarkies searching for the dynamic partition of CNF formulae. In twenty-first IEEE International Conference on Tools with Artificial Intelligence. In twenty-first International Joint Conference on Artificial Inteligence (ICTAI-09), Newark, New Jersey, November 2-5, 2009.

• Youssef Hamadi, Said Jabbour and Lakhdar Sais.Learning for Dynamic Subsumption. In twenty-first IEEE International Conference on Tools with Artificial Intelligence. In twenty-first International Joint Conference on Artificial Inteligence (ICTAI-09), Newark, New Jersey, November 2-5, 2009.

• Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais. Learning in local search. In twenty-first IEEE International Conference on Tools with Artificial Intelligence. In twenty-first International Joint Conference on Artificial Inteligence (ICTAI-09), Newark, New Jersey, November 2-5, 2009.

• D. D'Almeida, and L. Sais. Recherche de la substituabilité par l'arc-cohérence de singleton. Dans Journées Francophones de Programmation par Contraintes (JFPC'09), Orleans, France, 2009.

• G. Audemard, J.-M. Lagniez, B. Mazure, et L. Sais Analyse de conflits dans le cadre de la recherche locale. Dans Journées Francophones de Programmation par Contraintes (JFPC'09), Orleans, France, 2009.

• Y. Hamadi, S. Jabbour, and L. Sais. Subsumption dirigée par l'analyse de conflits. Dans Journées Francophones de Programmation par Contraintes (JFPC'09), Orleans, France, 2009.

• Y. Hamadi, S. Jabbour, and L. Sais. Réordonnancement dynamique basé sur l'apprentissage. Dans Journées Francophones de Programmation par Contraintes (JFPC'09), Orleans, France, 2009.

2008

• Probleme SAT : Progrés et Défis. Livre sous la direction de L. Sais. Hermes Publishing Ltd, London, mai 2008

• O. Dubois et L. Sais. Synthese et Défis. Chapitre du livre sur SAT, Hermes Publishing Ltd, London, mai 2008.

• C. Piette, Y. Hamadi, and L. Sais. Vivifying propositional clausal formulae, In proceedings of the 18th European Conference on Artificial Intelligence (ECAI'2008), Patras, Greece, 2008 (to appear)

• A. Chmeiss, V. Krawczyk, and L. Sais. Redundancy in CSPs, In proceedings of the 18th European Conference on Artificial Intelligence (ECAI'2008), Patras, Greece, 2008 (poster - to appear)

• A. Chmeiss, V. Krawczyk, and L. Sais. Autour de la redondance dans les CSPs, Actes des Journees Francophone de Programmation par Contraintes (JFPC'2008), Nantes, 2008, (Version longue du poster ECAI'08 - to appear)

• G. Audemard, L. Bordeaux, Y. Hamadi, S. Jabbour, and L. Sais. A Generalized Framework for Conflict Analysis, In proceedings of the SAT'2008 (short paper - to appear)

• G. Audemard, L. Bordeaux, Y. Hamadi, S. Jabbour, and L. Sais. Un cadre general pour l'analyse de conflits, Actes des Journees Francophone de Programmation par Contraintes (JFPC'2008), Nantes, 2008, (Version longue du papier SAT'08 - to appear)

• Gilles Audemard, Said Jabbour, and Lakhdar Sais. Graph-Based SAT Representation : A New Perspective. In Journal of Algorithms in Logic, Informatics and Cognition, 2008 (a paraître)

• O. Fourdrinoy and E. Grégoire and B. Mazure and L. Sais. Réduction d’instances de SAT vers des instances polynomiales, In in 16eme congres francophone Reconnaissance des Formes et Intelligence Artificielle (RFIA’08), pages 388-396, janvier 2008

2007

•  C. Lecoutre, L. Sais, and J. Vion. Using SAT Encodings to Derive CSP Value Ordering Heuristics. Journal on Satisfiability, Boolean Modeling and Computation, pages 69-186, 2007.

• C. Lecoutre, L. Sais, S. Tabary, and V. Vidal. Recording and Minimizing Nogoods from Restarts.Journal on Satisfiability, Boolean Modeling and Computation, pages 147-167, 2007.

•  Gilles Audemard, Said Jabbour and lakhdar Sais, Dealing with symmetries in quantified boolean formulas, Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI'2007), to appear. Hyderabad, India. January, 2007 [pdf]

• Lecoutre Christophe, Sais Lakhdar, Tabary Sebastien and Vidal Vincent. Nogood Recording from Restarts. Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI'2007), to appear. Hyderabad, India. January, 2007 (poster) [pdf].  

• D. Dalmeida, J.F. Condotta, C. Lecoutre, and L. Sais. Relaxation of Qualitative Constraint Networks. In Proceedings of SARA’2007, pages 93-108, Whistler, Canada, 2007.

• G. Audemard, L. Sais. Circuit Based Encoding for CNF formulas. In Proceedings of SAT’07, pages 16-21, Lisboa, Portugal, 2007.

• O. Fourdrinoy and E. Grégoire and B. Mazure and L. Sais. Reducing hard SAT instances to polynomial ones. In Proceedings of IRI’07, pages 18-23, Las Vegas, USA, 2007

• O. Fourdrinoy and E. Grégoire and B. Mazure and L. Sais. Eliminating redundant clauses in SAT instances. In Proceedings of CP-AI-OR’07, pages 71-83, Bruxelles, 2007

• L. Paris, R. Ostrowski, L. Sais and P. Siegel. From Horn Strong Backdoor Sets to Ordered Strong Backdoor Sets. In Proceedings of MICAI’2007, pages 105–117, Aguascalientes, Mexico 2007.

• C. Lecoutre, L. Sais, S. Tabary, and V. Vidal. Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance. In Proceedings of CP’07, pages 453-467, Providence, USA, 2007.

• A. Chmeiss, V. Krawczyck and L. Sais. Light Integration of Path Consistency for Solving CSPs In Proceedings of ICTAI’07, pages 263-266, Patras, Greece, 2007.

• C. Lecoutre, L. Sais, S. Tabary, and V. Vidal. Transposition tables for constraint satisfaction. In Proceedings of AAAI’07, pages 243-248, Vancouver, Canada, 2007.

• Gilles Audemard, Said Jabbour, and Lakhdar Sais. Efficient Symmetry breaking Predicates for quantified boolean formulae. In Proceedings of the Intl. Workshop on Symmetry and Constraint Satisfaction Problems (SymCon’07), 2007.

• O. Fourdrinoy and E. Grégoire and B. Mazure and L. Sais. Suppression des clauses redondantes dans des instances SAT, In Proceedings des 3emes Journées Francophones de Programmation par Contraintes (JFPC’07), pages 28-37,Paris, France, 2007

• C. Lecoutre, L. Sais, S. Tabary, and V. Vidal. Tables de transposition pour la satisfaction de contraintes, In Proceedings des 3emes Journées Francophones de Programmation par Contraintes (JFPC’07), pages 223–230, Paris, France, 2007.
  

2006

• Lecoutre Christophe, Sais Lakhdar and Vion Julien. Using SAT Encodings to derive CSP value ordering heuristics. Proceedings of the International Workshop on the Integration of SAT and CP techniques held with CP'2006, pages 33--47. Nantes, France. September, 2006 [pdf]. 

• Lecoutre Christophe, Sais Lakhdar, Tabary Sebastien and Vidal Vincent. Last Conflict based Reasoning. Proceedings of the 17th European Conference on Artificial Intelligence (ECAI'2006), pages 133--137. Trento, Italy. August, 2006 [pdf].

• Hemery Fred, Lecoutre Christophe, Sais Lakhdar and Boussemart Frederic. Extracting MUCs from Constraint Networks. Proceedings of the 17th European Conference on Artificial Intelligence (ECAI'2006), pages 113--117. Trento, Italy. August, 2006 [pdf]. 

• Lionel Paris, Richard Ostrowski, Lakhdar Sais, Pierre Siegel, "Approximation d'ensembles Horn strong backdoor par recherche locale", in: Actes des deuxièmes Journées Francophones de Programmation par Contraintes (JFPC' 2006), pp. 277-284, Nimes, Juin 2006.

• Condotta Jean-François, D'almeida Dominique, Lecoutre Christophe and Sais Lakhdar. From Qualitative to Discrete Constraint Networks. Proceedings of the International Workshop on Qualitative Constraint Calculi held with KI'2006, pages 54--64. Bremen, Germany. June, 2006 [pdf].

• Lionel Paris, Richard Ostrowski, Lakhdar Sais, Pierre Siegel, "Computing Horn Strong Backdoor Sets Thanks to Local Search", in:| Proceedings of the 18th International Conference on Tools with Artificial Intelligence (ICTAI'2006), pp. 5, Washington D.C., United States, November 13-15, 2006 [pdf].

• Lecoutre Christophe, Sais Lakhdar, Tabary Sebastien and Vidal Vincent. Recherche dirigee par le dernier conflit. Actes des secondes Journées Francophones de Programmation par Contraintes (JFPC'2006), pages 257--266. Nimes, France. June, 2006 [pdf].

• Hemery Fred, Lecoutre Christophe, Sais Lakhdar and Boussemart Frederic. Extraction de noyaux insatisfiables minimaux de reseaux de contraintes. Actes des secondes Journées Francophones de Programmation par Contraintes (JFPC'2006), pages 209--217. Nimes, France. June, 2006 [pdf]

• FOURDRINOY O., GREGOIRE E., MAZURE L., SAIS L. "Heuristique d'ordonnancement des variables pour SAT", ROADEF'06, Lille, France, janvier 2006.

2005

• GREGOIRE E., OSTROWSKI R., MAZURE B., SAIS L., "Automatic extraction of functional dependencies", Theory and Applications of Satisfiability Testing: 7th International Conference (SAT'04), LNCS 3542, Springer, Revised Selected Papers, pp 122-132, 2005                                                                  

• Darras S., Dequen G., Devendeville L., MAZURE B., OSTROWSKI R., SAIS L., "Using Boolean Constraint Propagation for Sub-clause Deduction", Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming (CP'05), Sitges, Espagne, Octobre 2005.
                                                                                                         
• FOURDRINOY O., GREGOIRE E., MAZURE B., SAIS L., "Exploring Hybrid Algorithms for SAT", dans : G. Sutcliffer and A. Voronkov (eds), Proceedings of the 12th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR'2005) (short papers), pp 33-37, Montego Bay, Jamaique, Décembre 2005
  
• GREGOIRE E., MAZURE B., OSTROWSKI R., SAIS L., "Dépendances Fonctionnelles Booléennes : Détection et Exploitation", Actes du Colloque sur l’Optimisation et les Systemes d’Informations (COSI'05), pp 263-274, Bejaia, Algérie, 2005
                                                                                                         
• AUDEMARD G., SAIS L., "Une approche Symbolique pour les Formules Booléennes Quantifiées", Actes du Colloque sur l’Optimisation et les Systèmes d’Informations (COSI'05), pp 285-296, Bejaia, Algérie, 2005
                                                                                                         
• AUDEMARD G., SAIS L., "A Symbolic Search Based Approach for Quantified Boolean Formulas", dans : T.Walsh,F.Bacchus, Proceedings of the 8th International Conference on Theory and Applications of Satisfiability Testing (SAT'05), LNCS 3569, Springer Verlag, vol. 3569, pp 16-30, 2005 [ps][pdf][bib]

• Darras S., Dequen G., Devendeville L., MAZURE B., OSTROWSKI R., SAIS L., "Utilisation de la Propagation de Contraintes pour la Production de Sous-Clauses", Premieres Journées Francophones de la Programmation par Contraintes (JFPC'05), pp 69-78, Lens, France, Juin 2005
                                                                                                         
• CHMEISS A., SAIS L., "De FC a MAC : un Algorithme Paramétrable pour la Résolution de CSP", Premieres Journées Francophones de la Programmation par Contraintes (JFPC'05), pp 267-276, Lens, France, Juin 2005
                                                                                                         
• AUDEMARD G., SAIS L., "Une approche symbolique pour les formules booléennes quantifiées", Premières Journées Francophones de la Programmation par Contraintes (JFPC'05), pp 59-68, Lens, France, Juin 2005 [ps] [pdf] [bib]
                                                                                                         
• BOUSSEMART F., Hemery F., LECOUTRE C., SAIS L., "Inférence de supports pour les algorithmes de filtrage générique", Actes des Premieres Journées Francophones de Programmation par Contraintes (JFPC'05), pp 89 - 98, Lens France, Juin 2005 [ps] [bib]
  

2004

• GREGOIRE E., OSTROWSKI R., MAZUREB.,SAISL., "Automatic Extraction of Functional Dependencies", The Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT 2004), Mai 2004

• Boussemart Frederic, Hemery Fred, Lecoutre Christophe and Saïs Lakhdar. Heuristiques de choix de variables dirigees par les conflits . Actes des 10èmes Journées Nationales sur la Résolution Pratique des Problemes NP-Complets (JNPC'2004), pages 91--105. Angers, France. June, 2004 [ps] [bib].

• Gilles Audemard, Bertrand Mazure et Lakdhar Sais, Symétries et formules booléennes quantifiées", Journées nationales des problemes NP complets, JNPC04, juin 2004 [ps] [pdf] [bib].
  

2003

• OSTROWSKI R., MAZURE B., SAIS L.,GREGOIREE., "Eliminating redundancies in SAT search trees", Proc. of the 15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'2003), pp 100-104, Sacramento, Novembre 2003

• A. Chmeiss et L. Sais, "About Neighborhood Substitutability in CSPs",  Proceedings of the Third International Workshop on Symmetry in Constraint Satisfaction problems (SymCon'2003), pp 41-45, Kinsale, County Cork, Ireland, Septembre 2003

• OSTROWSKI R., MAZURE B., SAIS L., "LSAT Solver v2.0", Manuel Technique : description du solveur, compétition SAT'03, 2003

2002

 

2001

• Bessière C., Chmeiss A., Saïs L., "Neihborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem", Proc. of the 7th International Conference on Principles and Practice of Constraint Programming (CP-01), pp 565-569,LNCS 2239, Springer Verlag, Paphos, Cyprus, Novembre 2001[ps]

• Grégoire É., Mazure B., Saïs L.,  Using failed local search as an oracle for tackling harder optimization problems more efficiently .

•  Brisoux L., Grégoire É., Saïs L., "Checking depth-limited consistency and inconsistency in knowledge-based systems", Int. Journ. of Intelligent Systems, volume 16, John Wiley, 2001.

• Bessière C., Chmeiss A., Saïs L., "Heuristiques multi-niveaux pour ordonner les variables dans les CSP",Actes des 7eme journées Nationales sur la résolution Pratique des problemes NP-Complets (JNPC'2001), pp 49-60,Toulouse-France, Juin 2001
  

1991-2000

• Saïs L., De la résolution du probleme SAT à la résolution de problèmes autour de SAT, Habilitation à diriger des recherches de l'université d'Artois, Lens, 15 décembre 2000. abstract [html], synthesis [ps] (194Ko), version complete:[ps]  (4.5 Mo)

• Chmeiss A., Saïs L., "About Local consistency in Solving CSPs", Proc. of the Twelfth IEEE Intl. Conf. on Tools with Artificial Intelligence (ICTAI-00), pp 104-107,IEEE Computer Press, Vancouver, Canada, Novembre 2000
  

• Bessant B., Grégoire E., Marquis P., Saïs L., "Iterated Syntax-Based Revision in a Nonmonotonic Setting,  in: M.-A. Williams and H. Rott (eds.), Frontiers in Belief Revision, Kluwer Academic Publishers, 2000 (sous presse).

• Grégoire É., Saïs L., "Practical inconsistency management for critical-tasks decision-support systems", Int. Journ. of  General Systems, vol. 29, n 1, pp. 123-140, 2000.

• Grégoire É., Saïs L., "Modelling and checking complex discrete critical system", Proc. of the Int. Conf. on Modelling and Simulation (MS'2000), R. Berriel, V. Hernandez,R. Montenegro and J. Rocha (eds.), pages 233-240, Las Palmas de Gran Canaria, Spain, 25-27 septembre 2000.
  
• Brisoux L., Saïs L. et Grégoire É., "Recherche locale : vers une exploitation des propriétés structurelles", Actes des 6emes Journées Nationales sur la R\'esolution Pratique des Problemes NP-complets (JNPC-00), Marseille, pp. 243-244, 2000.

1999

•  Brisoux L., Grégoire É.,  Saïs L., "Improving backtrack search for SAT by means of redundancy", Proc. of the 11th Int. Symposium on Methodologies for Intelligent Systems (ISMIS'99),  Z.W. Ras and A. Skowron (eds.), Varsovie, Pologne, LNCS 1609, Springer, pp. 301-309, juin 1999 [pdf].

•  Rauzy A., Saïs L. et Brisoux L., "Calcul Propositionnel : Vers une extension du formalisme", Actes des 5\iemes Journées Nationales sur la Résolution Pratique des Problemes NP-complets (JNPC-99), Lyon , pp. 189-198, 1999 [ps].

1998

•  Mazure B., Saïs L., Grégoire É., "Boosting complete techniques thanks to local search", Annals of Mathematics and Artificial Intelligence, vol.22, pp. 319-322, 1998 [ps].

• Grégoire É., Saïs L.,  "Practical Inconsistency Management for Critical-Tasks Decision Support Systems", in: D. Ruan (ed), Fuzzy Logic and Intelligent Technologies for Nuclear Science and Industry, World Scientific, Singapour,  pp. 384-391, 1998.
• Mazure B., Saïs L., Grégoire É., "System Description : CRIL  Platform for SAT", Proc. of the 15th Int. Conf. on Automated Deduction (CADE-15), C. Kirchner et H. Kirchner (eds.), Lindau, Allemagne, LNCS 1421,Springer, pp. 124-128, juillet 1998.

•  Bessant B., Grégoire É., Marquis P., Saïs L., "Combining nonmonotonic reasoning and belief revision: a practical approach", Proc. 8th Int. Conf. on Artificial Intelligence - Methodology, Systems, Applications (AIMSA'98), F. Giunchiglia (ed.), Sozopol, Bulgarie, LNCS 1480, Springer, pp. 115-128, septembre 1998 (Best paper Award) .

•  Bessant B., Grégoire É., Marquis P., Saïs L., "Syntax-based belief revision through local search", Proc. International Belief Revision Workshop, Trente, juin 1998.

• Grégoire E., Mazure B., Saïs L., "Logically-complete local search for propositional nonmonotonic knowledge bases", Proc. of the 7th Int. Workshop on Nonmonotonic Reasoning, I. Niemela et T. Schaub (eds.), pp.37-45, Trente, juin 1998


• Brisoux L., Saïs L., Grégoire E., Validation of knowledge-based systems by means of stochastic search, Proc. DEXA Workshop on Verification, Validation and Integrity Issues in Expert and Database Systems, R.R. Wagner (ed.), Vienne, IEEE Computer Press, pp. 41-46, septembre 1998.

• Brisoux L., Saïs L. et Grégoire E., "Mieux exploiter les échecs au sein des arbres de recherche a la Davis et Putnam", Actes des 4emes Journées Nationales sur la Résolution Pratique des Problemes NP-complets (JNPC-98), Nantes,  pp. 31-39, 1998.

• Grégoire E., Mazure B., Saïs L., "Logically-complete local search for propositional nonmonotonic knowledge bases", Proc. of the 7th Int. Workshop on Nonmonotonic Reasoning, I. Niemela et T. Schaub (eds.), pp.37-45, Trente, juin 1998.

• Brisoux L., Saïs L., Grégoire E., Validation of knowledge-based systems by means of stochastic search, Proc. DEXA Workshop on Verification, Validation and Integrity Issues in Expert and Database Systems, R.R. Wagner (ed.), Vienne, IEEE Computer Press, pp. 41-46, septembre 1998.

1997

• Mazure B., Saïs L., Grégoire É.,  "An efficient technique to ensure the logical consistency of cooperative agents", Int. Journ. of Cooperative Information Systems, vol. 6, no 1, pp. 27-36, 1997.

• Boufkhad Y., Grégoire É., Marquis P., Mazure B., Saïs L. "Tractable Cover Compilations, Proc. of the Int.  Joint Conf. on Artificial Intelligence( IJCAI'97), Nagoya, Japon, pp. 1201-1206, août 1997 [ps].

• Grégoire É., Mazure B., Saïs L.,  "A comparison of two approaches to inconsistency detecting", Proc. European Symp. on Intelligent Techniques, 20- 21 March, Bari, Italy, 1997.

•  Mazure B., Saïs L., Grégoire É. "Local search for common-sense reasoning", In D. Gabbay (ed.), Proc. of the Int. Joint Conference on qualitative and quantitative practical reasoning, LNCS 1244,Springer, Bad Honnef, Allemagne, pp. 122-130, juin 1997.

•  Mazure B., Saïs L., Grégoire É. "Tabu Search for SAT", Proc. of the 14th Nat. Conf. on Artificial Intelligence, AAAI'97, pp. 281-285, Providence, Rhode Island, USA, July 27-31, 1997 [ps].

• Mazure B., Saïs L., Grégoire É., "Local search for computing normal circumstances models", B. Reush (ed.), in Proc. of the computational Intelligence Conf. (theory and application), LNCS 1226, Springer, Dortmund, pp. 565-570, avril 1997.

1996

• Mazure B., Saïs L., Grégoire É., "Detecting logical inconsistencies", Proceedings of the Int. Symposium on Artificial Intelligence and Mathematics, pp. 116-121, Fort Lauderdale, Florida U.S.A., January 1996.

• Mazure B., Saïs L., Grégoire É., A powerful heuristic to locate inconsistent kernels in Knowledge-Based Systems,Proceedings of the 6th Int. Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems IPMU'96, Vol. 3, pp. 1265-1269, Granada Spain, July 1996.

• Mazure B., Saïs L., Grégoire É., "SUN: A multistrategy platform for SAT", First Int. Competition and Symp. on Satisfiability Testing , Beijing China, March 1996.

• Saïs L., SAT : Experiments meet theory, In T. Walsh (ed.), In Proceedings of the ECAI'96, Workshop on Empirical AI, Budapest Hungary, August 1996.

• Grégoire É., Saïs L., Inductive reasoning is sometimes deductive, In P. Falch (ed.), in Proc. of the ECAI'96 Workshop on Abductive and Inductive Reasoning, pp. 36-39, Budapest Hungary, August 1996.

• Mazure B., Saïs L., Grégoire É. "Deux  approches pour la  résolution du probleme SAT", 2eme conférence nationale sur résolution pratique des problemes NP-Complets \linebreak(CNPC'96), pp. 103-114, Dijon France, Mars 1996.

 1995

• Mazure B., Saïs L., Grégoire É, "Twsat: a new  local search algorithm for SAT. performance and analysis", Proceedings of the CP'95 Workshop On Solving Really Hard Problems, pp. 127-130, Cassis France,   September  1995.

• Groupe Bahia, "Étude Comparative de Trois Formalismes en Calcul Propositionnel", Actes des 5emes journées nationales du PRC-GDR Intelligence Artificielle. Teknea, p. 125-157, 1-3 Février, Nancy 1995.
  

• Projet Inter-PRC : "Classes Polynomiales : Travaux et Résultats", Actes des 5\iemes journées nationales du PRC-GDR Intelligence Artificielle. Teknea, pp. 3-28, 1-3 Février, Nancy 1995.

 1994

• Benhamou B., Saïs L., "Tractability through symmetries in propositional calculus", Journal of Automated Reasoning, 12 : 89-102, 1994.

• Saïs L., "Characterization of the set of models by means of symmetries", Proceedings of the second Workshop on the Principles and Practice of Contraint Programming(PPCP'94), Orcas Island, Washington USA, May 2-4 1994.

• Saïs L., Génisson R., "Some Ideas on Random Generation of K-Sat  Instances", J.M. Crawford and B. Selman (ed.), in Proc. of the AAAI'94 Workshop On Experimental Evaluation of Reasoning and Search Methods, pp. 91-93, July 31-August 1, Seattle, USA, 1994.

•  Saïs L.   "A Computational Study of DP with Symmetry on Hard Satisfiability Problems", in Proc. of the AAAI'94 Workshop On Experimental Evaluation of Reasoning and Search Methods(AAAI-94), pp. 52-56, July 31-August 1, Seattle, USA, 1994.

• Saïs L.,  "Finding non isomorphic solutions", In P. Jorrand and V. Sgurev, editors,  Proceedings of the 6th Inter. Conference on AI : Methodology, Systems and Application AIMSA'94, pp. 35-44, Sofia Bulgaria, Sept 21-24, 1994.
  

• Benhamou B., Saïs L.,  Two proof procedures for cardinality based language in propositional calculus, In P. Enjalbert, E. W. Mayr, K. W. Wagner (eds.), in Proc. of the 11th Int. Symposium on Theoritical Aspects of Computer Science STACS'94, LNCS 775, pp. 71-82, Caen France, Feb 24-26, 1994

1992

• Benhamou B., Saïs L., Theoretical study of symmetries in propositional calculus and applications. In D.Kapur (ed.), in Proc. of the 11th International Conference on Automated Deduction (CADE'11), LNCS 607, pp. 281-294, New York, June 1992.
  

• Saïs L., Génisson G., "Towards an understanding of hard satisfiability problems", In Geoff Suttcliffe (ed.), in Proc. of the  Workshop On Experimental Evaluation of Automated Theorem Proving Systems(CADE'12), pp. 24-29, June 28-July 1, Nancy, France, 1994.

• Benhamou B., Saïs L., Siegel P. Dealing with symmetries in propositional calculus, Workshop on Tractable Reasoning (AAAI'92), pp. 1-5, San Jose, California, 12-17 July 1992.

• Benhamou B., Saïs L., Siegel P. Dealing with cardinality formulas in propositional calculus, Workshop on Tractable Reasoning (AAAI'92), pp. 6-12, San Jose, California, 12-17 July 1992.
  

• Benhamou B., Saïs L., Formules de cardinalité et symétries en calcul propositionnel, Rencontres nationales des jeunes chercheurs en Intelligence Artificielle (RJCIA'92), pp. 242-256, 7-9 Septembre, Rennes 1992.

 

1991

Benhamou B., Saïs L., "Study of symmetries in propositional calculus", Intern. Workshop on Computer Science, Annaba, pp. 78-102, 16-18 Décembre 1991.