Travelled to:1 × China
1 × Germany
1 × Italy
1 × Portugal
1 × United Kingdom
2 × Canada
3 × USA
Collaborated with:G.Audemard B.Mazure S.Jabbour Y.Salhi É.Grégoire B.Benhamou R.Ostrowski T.Uno J.Lagniez L.Bordeaux Y.Hamadi
Talks about:formula (3) mine (3) base (3) symmetri (2) proposit (2) function (2) approach (2) extract (2) boolean (2) automat (2)
Person: Lakhdar Saïs
DBLP: Sa=iuml=s:Lakhdar
Contributed to:
2014
2013
201120082007200520042005
19981992Wrote 12 papers:
- KDIR-2014-BenhamouJSS #mining #symmetry
- Symmetry Breaking in Itemset Mining (BB, SJ, LS, YS), pp. 86–96.
- CIKM-2013-JabbourSS #mining #satisfiability #sequence
- Boolean satisfiability for sequence mining (SJ, LS, YS), pp. 649–658.
- CIKM-2013-JabbourSSU #approach
- Mining-based compression approach of propositional formulae (SJ, LS, YS, TU), pp. 289–298.
- SAT-2011-AudemardLMS #on the
- On Freezing and Reactivating Learnt Clauses (GA, JML, BM, LS), pp. 188–200.
- SAT-2008-AudemardBHJS #analysis #framework
- A Generalized Framework for Conflict Analysis (GA, LB, YH, SJ, LS), pp. 21–27.
- SAT-2007-AudemardS #encoding
- Circuit Based Encoding of CNF Formula (GA, LS), pp. 16–21.
- SAT-2005-AudemardS #approach #quantifier
- A Symbolic Search Based Approach for Quantified Boolean Formulas (GA, LS), pp. 16–30.
- SAT-2004-GregoireOMS #automation #dependence #functional
- Automatic Extraction of Functional Dependencies (ÉG, RO, BM, LS), pp. 157–165.
- SAT-J-2004-GregoireOMS05 #automation #dependence #functional
- Automatic Extraction of Functional Dependencies (ÉG, RO, BM, LS), pp. 122–132.
- CADE-1998-MazureSG #framework #platform #satisfiability
- System Description: CRIL Platform for SAT (BM, LS, ÉG), pp. 124–128.
- CADE-1992-BenhamouS #calculus #symmetry
- Theoretical Study of Symmetries in Propositional Calculus and Applications (BB, LS), pp. 281–294.