The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Lakhdar Sais: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Bertrand Mazure, Lakhdar Sais, Éric Grégoire
    Tabu Search for SAT. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 1997, pp:281-285 [Conf]
  2. Brigitte Bessant, Éric Grégoire, Pierre Marquis, Lakhdar Sais
    Combining Nonmonotonic Reasoning and Belief Revision: A Practical Approach. [Citation Graph (0, 0)][DBLP]
    AIMSA, 1998, pp:115-128 [Conf]
  3. Éric Grégoire, Bertrand Mazure, Lakhdar Sais
    Using Failed Local Search for SAT as an Oracle for Tackling Harder A.I. Problems More Efficiently. [Citation Graph (0, 0)][DBLP]
    AIMSA, 2002, pp:51-60 [Conf]
  4. Belaid Benhamou, Lakhdar Sais
    Theoretical Study of Symmetries in Propositional Calculus and Applications. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:281-294 [Conf]
  5. Bertrand Mazure, Lakhdar Sais, Éric Grégoire
    System Description: CRIL Platform for SAT. [Citation Graph (0, 0)][DBLP]
    CADE, 1998, pp:124-128 [Conf]
  6. Christian Bessière, Assef Chmeiss, Lakhdar Sais
    Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem. [Citation Graph (0, 0)][DBLP]
    CP, 2001, pp:565-569 [Conf]
  7. Frédéric Boussemart, Fred Hemery, Christophe Lecoutre, Lakhdar Sais
    Support Inference for Generic Filtering. [Citation Graph (0, 0)][DBLP]
    CP, 2004, pp:721-725 [Conf]
  8. Sylvain Darras, Gilles Dequen, Laure Devendeville, Bertrand Mazure, Richard Ostrowski, Lakhdar Sais
    Using Boolean Constraint Propagation for Sub-clauses Deduction. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:757-761 [Conf]
  9. Richard Ostrowski, Éric Grégoire, Bertrand Mazure, Lakhdar Sais
    Recovering and Exploiting Structural Knowledge from CNF Formulas. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:185-199 [Conf]
  10. Laure Brisoux, Éric Grégoire, Lakhdar Sais
    Validation of Knowledge-Based Systems by Means of Stochastic Search. [Citation Graph (0, 0)][DBLP]
    DEXA Workshop, 1998, pp:41-46 [Conf]
  11. Frédéric Boussemart, Fred Hemery, Christophe Lecoutre, Lakhdar Sais
    Boosting Systematic Search by Weighting Constraints. [Citation Graph (0, 0)][DBLP]
    ECAI, 2004, pp:146-150 [Conf]
  12. Fred Hemery, Christophe Lecoutre, Lakhdar Sais, Frédéric Boussemart
    Extracting MUCs from Constraint Networks. [Citation Graph (0, 0)][DBLP]
    ECAI, 2006, pp:113-117 [Conf]
  13. Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal
    Last Conflict Based Reasoning. [Citation Graph (0, 0)][DBLP]
    ECAI, 2006, pp:133-137 [Conf]
  14. Bertrand Mazure, Lakhdar Sais, Éric Grégoire
    Checking Several Forms of Consistency in Nonmonotonic Knowledge-Bases. [Citation Graph (0, 0)][DBLP]
    ECSQARU-FAPR, 1997, pp:122-130 [Conf]
  15. Bertrand Mazure, Lakhdar Sais, Éric Grégoire
    Local Search for Computing Normal Circumstances Models. [Citation Graph (0, 0)][DBLP]
    Fuzzy Days, 1997, pp:565-566 [Conf]
  16. Gilles Audemard, Lakhdar Sais
    SAT Based BDD Solver for Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    ICTAI, 2004, pp:82-89 [Conf]
  17. Assef Chmeiss, Lakhdar Sais
    About the use of local consistency in solving CSPs. [Citation Graph (0, 0)][DBLP]
    ICTAI, 2000, pp:104-107 [Conf]
  18. Assef Chmeiss, Lakhdar Sais
    Constraint Satisfaction Problems: Backtrack Search Revisited. [Citation Graph (0, 0)][DBLP]
    ICTAI, 2004, pp:252-257 [Conf]
  19. Richard Ostrowski, Bertrand Mazure, Lakhdar Sais, Éric Grégoire
    Eliminating Redundancies in SAT Search Trees. [Citation Graph (0, 0)][DBLP]
    ICTAI, 2003, pp:100-104 [Conf]
  20. Lionel Paris, Richard Ostrowski, Pierre Siegel, Lakhdar Sais
    Computing Horn Strong Backdoor Sets Thanks to Local Search. [Citation Graph (0, 0)][DBLP]
    ICTAI, 2006, pp:139-143 [Conf]
  21. Yacine Boufkhad, Éric Grégoire, Pierre Marquis, Bertrand Mazure, Lakhdar Sais
    Tractable Cover Compilations. [Citation Graph (0, 0)][DBLP]
    IJCAI (1), 1997, pp:122-127 [Conf]
  22. Gilles Audemard, Saïd Jabbour, Lakhdar Sais
    Symmetry Breaking in Quantified Boolean Formulae. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:2262-2267 [Conf]
  23. Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal
    Nogood Recording from Restarts. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:131-136 [Conf]
  24. Éric Grégoire, Bertrand Mazure, Cédric Piette, Lakhdar Sais
    A new heuristic-based albeit complete method to extract MUCs from unsatisfiable CSPs. [Citation Graph (0, 0)][DBLP]
    IRI, 2006, pp:325-329 [Conf]
  25. Laure Brisoux, Éric Grégoire, Lakhdar Sais
    Improving Backtrack Search for SAT by Means of Redundancy. [Citation Graph (0, 0)][DBLP]
    ISMIS, 1999, pp:301-309 [Conf]
  26. Gilles Audemard, Bertrand Mazure, Lakhdar Sais
    Dealing with Symmetries in Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  27. Gilles Audemard, Lakhdar Sais
    A Symbolic Search Based Approach for Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    SAT, 2005, pp:16-30 [Conf]
  28. Éric Grégoire, Richard Ostrowski, Bertrand Mazure, Lakhdar Sais
    Automatic Extraction of Functional Dependencies. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  29. Éric Grégoire, Richard Ostrowski, Bertrand Mazure, Lakhdar Sais
    Automatic Extraction of Functional Dependencies. [Citation Graph (0, 0)][DBLP]
    SAT (Selected Papers, 2004, pp:122-132 [Conf]
  30. Belaid Benhamou, Lakhdar Sais, Pierre Siegel
    Two Proof Procedures for a Cardinality Based Language in Propositional Calculus. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:71-82 [Conf]
  31. Bertrand Mazure, Lakhdar Sais, Éric Grégoire
    Boosting Complete Techniques Thanks to Local Search Methods. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1998, v:22, n:3-4, pp:319-331 [Journal]
  32. Bertrand Mazure, Lakhdar Sais, Éric Grégoire
    An Efficient Technique to Ensure the Logical Consistency of Interacting Knowledge Bases. [Citation Graph (0, 0)][DBLP]
    Int. J. Cooperative Inf. Syst., 1997, v:6, n:1, pp:27-36 [Journal]
  33. Laure Brisoux, Éric Grégoire, Lakhdar Sais
    Checking depth-limited consistency and inconsistency in knowledge-based systems. [Citation Graph (0, 0)][DBLP]
    Int. J. Intell. Syst., 2001, v:16, n:3, pp:319-331 [Journal]
  34. Belaid Benhamou, Lakhdar Sais
    Tractability Through Symmetries in Propositional Calculus. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1994, v:12, n:1, pp:89-102 [Journal]
  35. Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal
    Transposition Tables for Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:243-248 [Conf]
  36. Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal
    Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance. [Citation Graph (0, 0)][DBLP]
    CP, 2007, pp:453-467 [Conf]
  37. Olivier Fourdrinoy, Éric Grégoire, Bertrand Mazure, Lakhdar Sais
    Eliminating Redundant Clauses in SAT Instances. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2007, pp:71-83 [Conf]
  38. Olivier Fourdrinoy, Éric Grégoire, Bertrand Mazure, Lakhdar Sais
    Reducing hard SAT instances to polynomial ones. [Citation Graph (0, 0)][DBLP]
    IRI, 2007, pp:18-23 [Conf]
  39. Lionel Paris, Richard Ostrowski, Pierre Siegel, Lakhdar Sais
    From Horn Strong Backdoor Sets to Ordered Strong Backdoor Sets. [Citation Graph (0, 0)][DBLP]
    MICAI, 2007, pp:105-117 [Conf]
  40. Dominique D'Almeida, Jean-François Condotta, Christophe Lecoutre, Lakhdar Sais
    Relaxation of Qualitative Constraint Networks. [Citation Graph (0, 0)][DBLP]
    SARA, 2007, pp:93-108 [Conf]
  41. Gilles Audemard, Lakhdar Sais
    Circuit Based Encoding of CNF Formula. [Citation Graph (0, 0)][DBLP]
    SAT, 2007, pp:16-21 [Conf]

  42. Redundancy in CSPs. [Citation Graph (, )][DBLP]


  43. Vivifying Propositional Clausal Formulae. [Citation Graph (, )][DBLP]


  44. Efficient Combination of Decision Procedures for MUS Computation. [Citation Graph (, )][DBLP]


  45. Light Integration of Path Consistency for Solving CSPs. [Citation Graph (, )][DBLP]


  46. Local Autarkies Searching for the Dynamic Partition of CNF Formulae. [Citation Graph (, )][DBLP]


  47. Learning for Dynamic Subsumption. [Citation Graph (, )][DBLP]


  48. Learning in Local Search. [Citation Graph (, )][DBLP]


  49. Enhancing Neighbourhood Substitutability Thanks to Singleton Arc Consistency. [Citation Graph (, )][DBLP]


  50. Control-Based Clause Sharing in Parallel SAT Solving. [Citation Graph (, )][DBLP]


  51. A Generalized Framework for Conflict Analysis. [Citation Graph (, )][DBLP]


  52. Segmentation of 3D Brain Structures Using the Bayesian Generalized Fast Marching Method. [Citation Graph (, )][DBLP]


  53. Portfolio-based Parallel SAT solving. [Citation Graph (, )][DBLP]


  54. Reasoning from last conflict(s) in constraint programming. [Citation Graph (, )][DBLP]


  55. Learning for Dynamic subsumption [Citation Graph (, )][DBLP]


  56. Integrating Conflict Driven Clause Learning to Local Search [Citation Graph (, )][DBLP]


Search in 0.505secs, Finished in 0.508secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002