Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Lakhdar Sais
Lakhdar Saïs
2010 – today
- 2013
[i6]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi: Mining to Compact CNF Propositional Formulae. CoRR abs/1304.4415 (2013)- [i5]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi: Extending Modern SAT Solvers for Enumerating All Models. CoRR abs/1305.0574 (2013)
- [i4]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi: A Mining-Based Compression Approach for Constraint Satisfaction Problems. CoRR abs/1305.3321 (2013)
- 2012
- [j13]Youssef Hamadi, Saïd Jabbour, Lakhdar Sais: Learning from conflicts in propositional satisfiability. 4OR 10(1): 15-32 (2012)
- [j12]Saïd Jabbour, Lakhdar Sais: Symétries et QBF. Revue d'Intelligence Artificielle 26(1-2): 103-125 (2012)
- [c58]Emmanuel Coquery, Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi: A SAT-Based Approach for Discovering Frequent, Closed and Maximal Patterns in a Sequence. ECAI 2012: 258-263
- [c57]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi, Karim Tabia: Symmetries in Itemset Mining. ECAI 2012: 432-437
- [c56]Saïd Jabbour, Jerry Lonlac, Lakhdar Sais: Extending Resolution by Dynamic Substitution of Boolean Functions. ICTAI 2012: 1029-1034
- [c55]Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs: Intensification Search in Modern SAT Solvers - (Poster Presentation). SAT 2012: 491-492
- [i3]François Hantry, Lakhdar Saïs, Mohand-Said Hacid: On the Complexity of Computing Minimal Unsatisfiable LTL formulas. CoRR abs/1203.3706 (2012)
- [i2]Lakhdar Saïs, Mohand-Said Hacid, François Hantry: On the complexity of computing minimal unsatisfiable LTL formulas. Electronic Colloquium on Computational Complexity (ECCC) 19: 69 (2012)
- 2011
- [j11]Youssef Hamadi, Saïd Jabbour, Cédric Piette, Lakhdar Sais: Deterministic Parallel DPLL. JSAT 7(4): 127-132 (2011)
- [c54]Emmanuel Coquery, Saïd Jabbour, Lakhdar Sais: A Constraint Programming Approach for Enumerating Motifs in a Sequence. ICDM Workshops 2011: 1091-1097
- [c53]Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais: On Freezing and Reactivating Learnt Clauses. SAT 2011: 188-200
- 2010
- [j10]Youssef Hamadi, Saïd Jabbour, Lakhdar Sais: Learning for Dynamic Subsumption. International Journal on Artificial Intelligence Tools 19(4): 511-529 (2010)
- [c52]Mohamed Baghdadi, Nacéra Benamrane, Lakhdar Sais: Segmentation of 3D Brain Structures Using the Bayesian Generalized Fast Marching Method. Brain Informatics 2010: 156-167
- [c51]Long Guo, Youssef Hamadi, Saïd Jabbour, Lakhdar Sais: Diversification and Intensification in Parallel SAT Solving. CP 2010: 252-265
- [c50]
- [c49]Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais: Boosting Local Search Thanks to cdcl. LPAR (Yogyakarta) 2010: 474-488
2000 – 2009
- 2009
- [j9]Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal: Reasoning from last conflict(s) in constraint programming. Artif. Intell. 173(18): 1592-1614 (2009)
- [j8]Youssef Hamadi, Saïd Jabbour, Lakhdar Sais: ManySAT: a Parallel SAT Solver. JSAT 6(4): 245-262 (2009)
- [c48]Cédric Piette, Youssef Hamadi, Lakhdar Sais: Efficient Combination of Decision Procedures for MUS Computation. FroCoS 2009: 335-349
- [c47]Dominique D'Almeida, Lakhdar Sais: Enhancing Neighbourhood Substitutability Thanks to Singleton Arc Consistency. ICTAI 2009: 91-98
- [c46]Éric Grégoire, Bertrand Mazure, Lakhdar Sais: Local Autarkies Searching for the Dynamic Partition of CNF Formulae. ICTAI 2009: 107-114
- [c45]
- [c44]Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais: Learning in Local Search. ICTAI 2009: 417-424
- [c43]Youssef Hamadi, Saïd Jabbour, Lakhdar Sais: Control-Based Clause Sharing in Parallel SAT Solving. IJCAI 2009: 499-504
- [c42]Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais: Integrating Conflict Driven Clause Learning to Local Search. LSCS 2009: 55-68
- [i1]Youssef Hamadi, Saïd Jabbour, Lakhdar Sais: Learning for Dynamic subsumption. CoRR abs/0904.0029 (2009)
- 2008
- [j7]Gilles Audemard, Saïd Jabbour, Lakhdar Sais: SAT graph-based representation: A new perspective. J. Algorithms 63(1-3): 17-33 (2008)
- [c41]Cédric Piette, Youssef Hamadi, Lakhdar Sais: Vivifying Propositional Clausal Formulae. ECAI 2008: 525-529
- [c40]
- [c39]Gilles Audemard, Lucas Bordeaux, Youssef Hamadi, Saïd Jabbour, Lakhdar Sais: A Generalized Framework for Conflict Analysis. SAT 2008: 21-27
- 2007
- [j6]Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal: Recording and Minimizing Nogoods from Restarts. JSAT 1(3-4): 147-167 (2007)
- [j5]Christophe Lecoutre, Lakhdar Sais, Julien Vion: Using SAT Encodings to Drive CSP Value Ordering Heuristics. JSAT 1(3-4): 169-186 (2007)
- [c38]Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal: Transposition Tables for Constraint Satisfaction. AAAI 2007: 243-248
- [c37]Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal: Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance. CP 2007: 453-467
- [c36]Olivier Fourdrinoy, Éric Grégoire, Bertrand Mazure, Lakhdar Sais: Eliminating Redundant Clauses in SAT Instances. CPAIOR 2007: 71-83
- [c35]Assef Chmeiss, Vincent Krawczyk, Lakhdar Sais: Light Integration of Path Consistency for Solving CSPs. ICTAI (1) 2007: 263-266
- [c34]Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal: Nogood Recording from Restarts. IJCAI 2007: 131-136
- [c33]Gilles Audemard, Saïd Jabbour, Lakhdar Sais: Symmetry Breaking in Quantified Boolean Formulae. IJCAI 2007: 2262-2267
- [c32]Olivier Fourdrinoy, Éric Grégoire, Bertrand Mazure, Lakhdar Sais: Reducing hard SAT instances to polynomial ones. IRI 2007: 18-23
- [c31]Lionel Paris, Richard Ostrowski, Pierre Siegel, Lakhdar Sais: From Horn Strong Backdoor Sets to Ordered Strong Backdoor Sets. MICAI 2007: 105-117
- [c30]Dominique D'Almeida, Jean-François Condotta, Christophe Lecoutre, Lakhdar Sais: Relaxation of Qualitative Constraint Networks. SARA 2007: 93-108
- [c29]
- 2006
- [c28]Fred Hemery, Christophe Lecoutre, Lakhdar Sais, Frédéric Boussemart: Extracting MUCs from Constraint Networks. ECAI 2006: 113-117
- [c27]Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal: Last Conflict Based Reasoning. ECAI 2006: 133-137
- [c26]Lionel Paris, Richard Ostrowski, Pierre Siegel, Lakhdar Sais: Computing Horn Strong Backdoor Sets Thanks to Local Search. ICTAI 2006: 139-143
- [c25]Éric Grégoire, Bertrand Mazure, Cédric Piette, Lakhdar Sais: A new heuristic-based albeit complete method to extract MUCs from unsatisfiable CSPs. IRI 2006: 325-329
- 2005
- [c24]Sylvain Darras, Gilles Dequen, Laure Devendeville, Bertrand Mazure, Richard Ostrowski, Lakhdar Sais: Using Boolean Constraint Propagation for Sub-clauses Deduction. CP 2005: 757-761
- [c23]Gilles Audemard, Lakhdar Sais: A Symbolic Search Based Approach for Quantified Boolean Formulas. SAT 2005: 16-30
- 2004
- [c22]Frédéric Boussemart, Fred Hemery, Christophe Lecoutre, Lakhdar Sais: Support Inference for Generic Filtering. CP 2004: 721-725
- [c21]Frédéric Boussemart, Fred Hemery, Christophe Lecoutre, Lakhdar Sais: Boosting Systematic Search by Weighting Constraints. ECAI 2004: 146-150
- [c20]Gilles Audemard, Lakhdar Sais: SAT Based BDD Solver for Quantified Boolean Formulas. ICTAI 2004: 82-89
- [c19]Assef Chmeiss, Lakhdar Sais: Constraint Satisfaction Problems: Backtrack Search Revisited. ICTAI 2004: 252-257
- [c18]Gilles Audemard, Bertrand Mazure, Lakhdar Sais: Dealing with Symmetries in Quantified Boolean Formulas. SAT 2004
- [c17]Éric Grégoire, Richard Ostrowski, Bertrand Mazure, Lakhdar Sais: Automatic Extraction of Functional Dependencies. SAT 2004
- [c16]Éric Grégoire, Richard Ostrowski, Bertrand Mazure, Lakhdar Sais: Automatic Extraction of Functional Dependencies. SAT (Selected Papers 2004: 122-132
- 2003
- [c15]Richard Ostrowski, Bertrand Mazure, Lakhdar Sais, Éric Grégoire: Eliminating Redundancies in SAT Search Trees. ICTAI 2003: 100-104
- 2002
- [c14]Éric Grégoire, Bertrand Mazure, Lakhdar Sais: Using Failed Local Search for SAT as an Oracle for Tackling Harder A.I. Problems More Efficiently. AIMSA 2002: 51-60
- [c13]Richard Ostrowski, Éric Grégoire, Bertrand Mazure, Lakhdar Sais: Recovering and Exploiting Structural Knowledge from CNF Formulas. CP 2002: 185-199
- 2001
- [j4]Laure Brisoux, Éric Grégoire, Lakhdar Sais: Checking depth-limited consistency and inconsistency in knowledge-based systems. Int. J. Intell. Syst. 16(3): 319-331 (2001)
- [c12]Christian Bessière, Assef Chmeiss, Lakhdar Sais: Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem. CP 2001: 565-569
- 2000
- [c11]Assef Chmeiss, Lakhdar Sais: About the use of local consistency in solving CSPs. ICTAI 2000: 104-107
1990 – 1999
- 1999
- [c10]Laure Brisoux, Éric Grégoire, Lakhdar Sais: Improving Backtrack Search for SAT by Means of Redundancy. ISMIS 1999: 301-309
- 1998
- [j3]Bertrand Mazure, Lakhdar Sais, Éric Grégoire: Boosting Complete Techniques Thanks to Local Search Methods. Ann. Math. Artif. Intell. 22(3-4): 319-331 (1998)
- [c9]Brigitte Bessant, Éric Grégoire, Pierre Marquis, Lakhdar Sais: Combining Nonmonotonic Reasoning and Belief Revision: A Practical Approach. AIMSA 1998: 115-128
- [c8]Bertrand Mazure, Lakhdar Sais, Éric Grégoire: System Description: CRIL Platform for SAT. CADE 1998: 124-128
- [c7]Laure Brisoux, Éric Grégoire, Lakhdar Sais: Validation of Knowledge-Based Systems by Means of Stochastic Search. DEXA Workshop 1998: 41-46
- 1997
- [j2]Bertrand Mazure, Lakhdar Sais, Éric Grégoire: An Efficient Technique to Ensure the Logical Consistency of Interacting Knowledge Bases. Int. J. Cooperative Inf. Syst. 6(1): 27-36 (1997)
- [c6]
- [c5]Bertrand Mazure, Lakhdar Sais, Éric Grégoire: Checking Several Forms of Consistency in Nonmonotonic Knowledge-Bases. ECSQARU-FAPR 1997: 122-130
- [c4]Bertrand Mazure, Lakhdar Sais, Éric Grégoire: Local Search for Computing Normal Circumstances Models. Fuzzy Days 1997: 565-566
- [c3]Yacine Boufkhad, Éric Grégoire, Pierre Marquis, Bertrand Mazure, Lakhdar Sais: Tractable Cover Compilations. IJCAI (1) 1997: 122-127
- 1994
- [j1]Belaid Benhamou, Lakhdar Sais: Tractability Through Symmetries in Propositional Calculus. J. Autom. Reasoning 12(1): 89-102 (1994)
- [c2]Belaid Benhamou, Lakhdar Sais, Pierre Siegel: Two Proof Procedures for a Cardinality Based Language in Propositional Calculus. STACS 1994: 71-82
- 1992
- [c1]Belaid Benhamou, Lakhdar Sais: Theoretical Study of Symmetries in Propositional Calculus and Applications. CADE 1992: 281-294
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-03 20:10 CEST by the dblp team