2009 |
48 | EE | Youssef Hamadi,
Saïd Jabbour,
Lakhdar Sais:
Learning for Dynamic subsumption
CoRR abs/0904.0029: (2009) |
2008 |
47 | EE | Cédric Piette,
Youssef Hamadi,
Lakhdar Sais:
Vivifying Propositional Clausal Formulae.
ECAI 2008: 525-529 |
46 | EE | Assef Chmeiss,
Vincent Krawczyk,
Lakhdar Sais:
Redundancy in CSPs.
ECAI 2008: 907-908 |
45 | EE | Gilles Audemard,
Lucas Bordeaux,
Youssef Hamadi,
Saïd Jabbour,
Lakhdar Sais:
A Generalized Framework for Conflict Analysis.
SAT 2008: 21-27 |
44 | EE | Gilles Audemard,
Saïd Jabbour,
Lakhdar Sais:
SAT graph-based representation: A new perspective.
J. Algorithms 63(1-3): 17-33 (2008) |
2007 |
43 | | Christophe Lecoutre,
Lakhdar Sais,
Sébastien Tabary,
Vincent Vidal:
Transposition Tables for Constraint Satisfaction.
AAAI 2007: 243-248 |
42 | EE | Christophe Lecoutre,
Lakhdar Sais,
Sébastien Tabary,
Vincent Vidal:
Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance.
CP 2007: 453-467 |
41 | EE | Olivier Fourdrinoy,
Éric Grégoire,
Bertrand Mazure,
Lakhdar Sais:
Eliminating Redundant Clauses in SAT Instances.
CPAIOR 2007: 71-83 |
40 | EE | Assef Chmeiss,
Vincent Krawczyk,
Lakhdar Sais:
Light Integration of Path Consistency for Solving CSPs.
ICTAI (1) 2007: 263-266 |
39 | EE | Christophe Lecoutre,
Lakhdar Sais,
Sébastien Tabary,
Vincent Vidal:
Nogood Recording from Restarts.
IJCAI 2007: 131-136 |
38 | EE | Gilles Audemard,
Saïd Jabbour,
Lakhdar Sais:
Symmetry Breaking in Quantified Boolean Formulae.
IJCAI 2007: 2262-2267 |
37 | EE | Olivier Fourdrinoy,
Éric Grégoire,
Bertrand Mazure,
Lakhdar Sais:
Reducing hard SAT instances to polynomial ones.
IRI 2007: 18-23 |
36 | EE | Lionel Paris,
Richard Ostrowski,
Pierre Siegel,
Lakhdar Sais:
From Horn Strong Backdoor Sets to Ordered Strong Backdoor Sets.
MICAI 2007: 105-117 |
35 | EE | Dominique D'Almeida,
Jean-François Condotta,
Christophe Lecoutre,
Lakhdar Sais:
Relaxation of Qualitative Constraint Networks.
SARA 2007: 93-108 |
34 | EE | Gilles Audemard,
Lakhdar Sais:
Circuit Based Encoding of CNF Formula.
SAT 2007: 16-21 |
33 | EE | Christophe Lecoutre,
Lakhdar Sais,
Sébastien Tabary,
Vincent Vidal:
Recording and Minimizing Nogoods from Restarts.
JSAT 1(3-4): 147-167 (2007) |
2006 |
32 | | Fred Hemery,
Christophe Lecoutre,
Lakhdar Sais,
Frédéric Boussemart:
Extracting MUCs from Constraint Networks.
ECAI 2006: 113-117 |
31 | | Christophe Lecoutre,
Lakhdar Sais,
Sébastien Tabary,
Vincent Vidal:
Last Conflict Based Reasoning.
ECAI 2006: 133-137 |
30 | EE | Lionel Paris,
Richard Ostrowski,
Pierre Siegel,
Lakhdar Sais:
Computing Horn Strong Backdoor Sets Thanks to Local Search.
ICTAI 2006: 139-143 |
29 | | É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 |
28 | EE | Sylvain Darras,
Gilles Dequen,
Laure Devendeville,
Bertrand Mazure,
Richard Ostrowski,
Lakhdar Sais:
Using Boolean Constraint Propagation for Sub-clauses Deduction.
CP 2005: 757-761 |
27 | EE | Gilles Audemard,
Lakhdar Sais:
A Symbolic Search Based Approach for Quantified Boolean Formulas.
SAT 2005: 16-30 |
2004 |
26 | EE | Frédéric Boussemart,
Fred Hemery,
Christophe Lecoutre,
Lakhdar Sais:
Support Inference for Generic Filtering.
CP 2004: 721-725 |
25 | | Frédéric Boussemart,
Fred Hemery,
Christophe Lecoutre,
Lakhdar Sais:
Boosting Systematic Search by Weighting Constraints.
ECAI 2004: 146-150 |
24 | EE | Assef Chmeiss,
Lakhdar Sais:
Constraint Satisfaction Problems: Backtrack Search Revisited.
ICTAI 2004: 252-257 |
23 | EE | Gilles Audemard,
Lakhdar Sais:
SAT Based BDD Solver for Quantified Boolean Formulas.
ICTAI 2004: 82-89 |
22 | EE | Éric Grégoire,
Richard Ostrowski,
Bertrand Mazure,
Lakhdar Sais:
Automatic Extraction of Functional Dependencies.
SAT 2004 |
21 | EE | Gilles Audemard,
Bertrand Mazure,
Lakhdar Sais:
Dealing with Symmetries in Quantified Boolean Formulas.
SAT 2004 |
20 | EE | Éric Grégoire,
Richard Ostrowski,
Bertrand Mazure,
Lakhdar Sais:
Automatic Extraction of Functional Dependencies.
SAT (Selected Papers 2004: 122-132 |
2003 |
19 | EE | Richard Ostrowski,
Bertrand Mazure,
Lakhdar Sais,
Éric Grégoire:
Eliminating Redundancies in SAT Search Trees.
ICTAI 2003: 100-104 |
2002 |
18 | EE | É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 |
17 | EE | Richard Ostrowski,
Éric Grégoire,
Bertrand Mazure,
Lakhdar Sais:
Recovering and Exploiting Structural Knowledge from CNF Formulas.
CP 2002: 185-199 |
2001 |
16 | EE | Christian Bessière,
Assef Chmeiss,
Lakhdar Sais:
Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem.
CP 2001: 565-569 |
15 | | 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) |
2000 |
14 | EE | Assef Chmeiss,
Lakhdar Sais:
About the use of local consistency in solving CSPs.
ICTAI 2000: 104-107 |
1999 |
13 | | Laure Brisoux,
Éric Grégoire,
Lakhdar Sais:
Improving Backtrack Search for SAT by Means of Redundancy.
ISMIS 1999: 301-309 |
1998 |
12 | EE | Brigitte Bessant,
Éric Grégoire,
Pierre Marquis,
Lakhdar Sais:
Combining Nonmonotonic Reasoning and Belief Revision: A Practical Approach.
AIMSA 1998: 115-128 |
11 | EE | Bertrand Mazure,
Lakhdar Sais,
Éric Grégoire:
System Description: CRIL Platform for SAT.
CADE 1998: 124-128 |
10 | | Laure Brisoux,
Éric Grégoire,
Lakhdar Sais:
Validation of Knowledge-Based Systems by Means of Stochastic Search.
DEXA Workshop 1998: 41-46 |
9 | | 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) |
1997 |
8 | | Bertrand Mazure,
Lakhdar Sais,
Éric Grégoire:
Tabu Search for SAT.
AAAI/IAAI 1997: 281-285 |
7 | | Bertrand Mazure,
Lakhdar Sais,
Éric Grégoire:
Checking Several Forms of Consistency in Nonmonotonic Knowledge-Bases.
ECSQARU-FAPR 1997: 122-130 |
6 | | Bertrand Mazure,
Lakhdar Sais,
Éric Grégoire:
Local Search for Computing Normal Circumstances Models.
Fuzzy Days 1997: 565-566 |
5 | | Yacine Boufkhad,
Éric Grégoire,
Pierre Marquis,
Bertrand Mazure,
Lakhdar Sais:
Tractable Cover Compilations.
IJCAI (1) 1997: 122-127 |
4 | | 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) |
1994 |
3 | | Belaid Benhamou,
Lakhdar Sais,
Pierre Siegel:
Two Proof Procedures for a Cardinality Based Language in Propositional Calculus.
STACS 1994: 71-82 |
2 | | Belaid Benhamou,
Lakhdar Sais:
Tractability Through Symmetries in Propositional Calculus.
J. Autom. Reasoning 12(1): 89-102 (1994) |
1992 |
1 | | Belaid Benhamou,
Lakhdar Sais:
Theoretical Study of Symmetries in Propositional Calculus and Applications.
CADE 1992: 281-294 |