default search action
Lakhdar Sais
Lakhdar Saïs
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j29]Jerry Lonlac
, Imen Ouled Dlala, Saïd Jabbour, Engelbert Mephu Nguifo, Badran Raddaoui, Lakhdar Saïs:
On the Discovery of Frequent Gradual Patterns: A Symbolic AI-Based Framework. SN Comput. Sci. 5(7): 944 (2024) - [j28]Asma Douadi, Nadjet Kamel, Lakhdar Sais:
Label propagation algorithm for community discovery based on centrality and common neighbours. J. Supercomput. 80(8): 11816-11842 (2024) - 2023
- [j27]Wafaa Rajaa Drioua
Breast Cancer Histopathological Images Segmentation Using Deep Learning. Sensors 23(17): 7318 (2023) - [c112]Jerry Lonlac
Extracting Frequent Gradual Patterns Based on SAT. DATA 2023: 136-143 - [c111]David Ing, Fabien Delorme, Saïd Jabbour, Nelly Robin, Lakhdar Sais:
Classification with Explanation for Human Trafficking Networks. DSAA 2023: 1-10 - [c110]Saïd Jabbour, Badran Raddaoui, Lakhdar Sais:
A Symbolic Approach to Computing Disjunctive Association Rules from Data. IJCAI 2023: 2133-2141 - 2022
- [j26]Ikram Nekkache, Saïd Jabbour, Nadjet Kamel, Lakhdar Sais:
Detecting and exploiting symmetries in sequential pattern mining. Int. J. Data Min. Model. Manag. 14(4): 309-334 (2022) - [c109]Saïd Jabbour, Nizar Mhadhbi, Badran Raddaoui, Lakhdar Sais:
A Declarative Framework for Maximal k-plex Enumeration Problems. AAMAS 2022: 660-668 - [c108]Wafaa Rajaa Drioua, Nacéra Benamrane, Lakhdar Sais:
Breast Cancer Detection from Histopathology Images Based on YOLOv5. ICFSP 2022: 30-34 - 2021
- [j25]Sofiane Touati
A Bayesian Monte Carlo method for computing the Shapley value: Application to weighted voting and bin packing games. Comput. Oper. Res. 125: 105094 (2021) - [c107]Ikram Nekkache
Towards a Compact SAT-Based Encoding of Itemset Mining Tasks. CPAIOR 2021: 163-178 - 2020
- [j24]Saïd Jabbour, Nizar Mhadhbi, Badran Raddaoui, Lakhdar Sais:
SAT-based models for overlapping community detection in networks. Computing 102(5): 1275-1299 (2020)
2010 – 2019
- 2019
- [j23]Kahina Bouchama, Arnaud Lallouet, Mohammed Said Radjef
Solving a Potential Clustering Game. Int. J. Artif. Intell. Tools 28(2): 1950006:1-1950006:26 (2019) - [c106]Saïd Jabbour, Nizar Mhadhbi, Badran Raddaoui, Lakhdar Sais:
Représentations compactes des graphes et contraintes pseudo booléennes. EGC 2019: 407-412 - [c105]Saïd Jabbour, Jerry Lonlac
Mining Gradual Itemsets Using Sequential Pattern Mining. FUZZ-IEEE 2019: 1-6 - [i10]Jerry Lonlac, Saïd Jabbour, Engelbert Mephu Nguifo
Extracting Frequent Gradual Patterns Using Constraints Modeling. CoRR abs/1903.08452 (2019) - 2018
- [j22]Abdelhamid Boudane, Saïd Jabbour, Lakhdar Sais, Yakoub Salhi
SAT-Based Data Mining. Int. J. Artif. Intell. Tools 27(1): 1840002:1-1840002:24 (2018) - [j21]Saïd Jabbour, Jerry Lonlac
Revisiting the Learned Clauses Database Reduction Strategies. Int. J. Artif. Intell. Tools 27(8): 1850033:1-1850033:19 (2018) - [c104]Saïd Jabbour, Nizar Mhadhbi, Badran Raddaoui, Lakhdar Sais:
Triangle-Driven Community Detection in Large Graphs Using Propositional Satisfiability. AINA 2018: 437-444 - [c103]Saïd Jabbour, Nizar Mhadhbi, Badran Raddaoui, Lakhdar Sais:
Detecting Highly Overlapping Community Structure by Model-based Maximal Clique Expansion. IEEE BigData 2018: 1031-1036 - [c102]Saïd Jabbour, Fatima Ezzahra Mana, Imen Ouled Dlala, Badran Raddaoui, Lakhdar Sais:
On Maximal Frequent Itemsets Mining with Constraints. CP 2018: 554-569 - [c101]Imen Ouled Dlala, Saïd Jabbour, Badran Raddaoui, Lakhdar Sais:
A Parallel SAT-Based Framework for Closed Frequent Itemsets Mining. CP 2018: 570-587 - [c100]Saïd Jabbour, Nizar Mhadhbi, Badran Raddaoui, Lakhdar Sais:
Pushing the Envelope in Overlapping Communities Detection. IDA 2018: 151-163 - [c99]Abdelhamid Boudane, Saïd Jabbour, Badran Raddaoui, Lakhdar Sais:
Efficient SAT-Based Encodings of Conditional Cardinality Constraints. LPAR 2018: 181-195 - [e1]Youssef Hamadi, Lakhdar Sais:
Handbook of Parallel Constraint Reasoning. Springer 2018, ISBN 978-3-319-63515-6 [contents] - [i9]Abdelhamid Boudane, Saïd Jabbour, Badran Raddaoui, Lakhdar Sais:
Efficient Encodings of Conditional Cardinality Constraints. CoRR abs/1804.00211 (2018) - 2017
- [j20]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi
Mining Top-k motifs with a SAT-based framework. Artif. Intell. 244: 30-47 (2017) - [j19]Balasim Al-Saedi, Olivier Fourdrinoy, Éric Grégoire, Bertrand Mazure, Lakhdar Saïs:
About some UP-based polynomial fragments of SAT. Ann. Math. Artif. Intell. 79(1-3): 25-44 (2017) - [j18]Saïd Jabbour, Yue Ma, Badran Raddaoui, Lakhdar Sais:
Quantifying conflicts in propositional logic through prime implicates. Int. J. Approx. Reason. 89: 27-40 (2017) - [j17]Mohamed Baghdadi
Fuzzy generalized fast marching method for 3D segmentation of brain structures. Int. J. Imaging Syst. Technol. 27(3): 281-306 (2017) - [c98]Saïd Jabbour, Nizar Mhadhbi, Badran Raddaoui, Lakhdar Sais:
Finding Overlapping Communities in Networks Using Propositional Satisfiability. EDA 2017: 67-80 - [c97]Abdelhamid Boudane, Saïd Jabbour, Lakhdar Sais, Yakoub Salhi:
Une approche logique pour la fouille de règles d'association. EGC 2017: 357-362 - [c96]Soukaina Hattad, Saïd Jabbour, Lakhdar Sais, Yakoub Salhi
Enhancing Pigeon-Hole based Encoding of Boolean Cardinality Constraints. ICAART (2) 2017: 299-307 - [c95]Yazid Boumarafi, Lakhdar Sais, Yakoub Salhi
From SAT to Maximum Independent Set: A New Approach to Characterize Tractable Classes. LPAR 2017: 286-299 - [c94]Abdelhamid Boudane, Saïd Jabbour, Lakhdar Sais, Yakoub Salhi
Clustering Complex Data Represented as Propositional Formulas. PAKDD (2) 2017: 441-452 - [c93]Saïd Jabbour, Nizar Mhadhbi, Badran Raddaoui, Lakhdar Sais:
A SAT-Based Framework for Overlapping Community Detection in Networks. PAKDD (2) 2017: 786-798 - [c92]Abdelhamid Boudane, Saïd Jabbour, Lakhdar Sais, Yakoub Salhi
Enumerating Non-redundant Association Rules Using Satisfiability. PAKDD (1) 2017: 824-836 - [c91]Saïd Jabbour, Fatima Zahra Mana, Lakhdar Sais:
On Maximal Frequent Itemsets Enumeration. SoCPaR 2017: 151-160 - 2016
- [j16]Youssef Hamadi, Saïd Jabbour, Lakhdar Saïs:
What we can learn from conflicts in propositional satisfiability. Ann. Oper. Res. 240(1): 13-37 (2016) - [c90]Saïd Jabbour, Nizar Mhadhbi, Abdesattar Mhadhbi, Badran Raddaoui, Lakhdar Sais:
Summarizing big graphs by means of pseudo-boolean constraints. IEEE BigData 2016: 889-894 - [c89]Saïd Jabbour, Badran Raddaoui, Lakhdar Sais, Yakoub Salhi
On the Computation of Top-k Extensions in Abstract Argumentation Frameworks. ECAI 2016: 913-920 - [c88]Saïd Jabbour, Lakhdar Sais:
Exploiting MUS Structure to Measure Inconsistency of Knowledge Bases. ECAI 2016: 991-998 - [c87]Saïd Jabbour, Badran Raddaoui, Lakhdar Sais:
Knowledge Base Compilation for Inconsistency Measures. ICAART (2) 2016: 532-539 - [c86]Imen Ouled Dlala, Saïd Jabbour, Badran Raddaoui, Lakhdar Sais, Boutheina Ben Yaghlane:
A SAT-Based Approach for Enumerating Interesting Patterns from Uncertain Data. ICTAI 2016: 255-262 - [c85]Saïd Jabbour, Souhila Kaci, Lakhdar Sais, Yakoub Salhi
Itemset Mining with Penalties. ICTAI 2016: 962-966 - [c84]Abdelhamid Boudane, Saïd Jabbour, Lakhdar Sais, Yakoub Salhi:
A SAT-Based Approach for Mining Association Rules. IJCAI 2016: 2472-2478 - [c83]Kahina Bouchama, Mohammed Said Radjef, Lakhdar Sais:
Z-Equilibrium For a CSP Game. ISAIM 2016 - [c82]Saïd Jabbour, Yue Ma, Badran Raddaoui, Lakhdar Sais, Yakoub Salhi:
A MIS Partition Based Framework for Measuring Inconsistency. KR 2016: 84-93 - [c81]Imen Ouled Dlala, Saïd Jabbour, Lakhdar Saïs, Boutheina Ben Yaghlane:
A Comparative Study of SAT-Based Itemsets Mining. SGAI Conf. 2016: 37-52 - 2015
- [c80]Imen Ouled Dlala, Saïd Jabbour, Lakhdar Sais, Yakoub Salhi
Parallel SAT based closed frequent itemsets enumeration. AICCSA 2015: 1-8 - [c79]Saïd Jabbour, Yue Ma, Badran Raddaoui, Lakhdar Sais, Yakoub Salhi:
On Structure-Based Inconsistency Measures and Their Computations via Closed Set Packing. AAMAS 2015: 1749-1750 - [c78]Saïd Jabbour, Badran Raddaoui, Lakhdar Sais:
Inconsistency-based Ranking of Knowledge Bases. ICAART (2) 2015: 414-419 - [c77]Saïd Jabbour, Stéphanie Roussel
Mining to Compress Table Constraints. ICTAI 2015: 405-412 - [c76]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi
Decomposition Based SAT Encodings for Itemset Mining Problems. PAKDD (2) 2015: 662-674 - [i8]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi:
On SAT Models Enumeration in Itemset Mining. CoRR abs/1506.02561 (2015) - 2014
- [j15]Saïd Jabbour, Jerry Lonlac
Résolution étendue par substitution dynamique des fonctions booléennes. Rev. d'Intelligence Artif. 28(6): 645-663 (2014) - [c75]Saïd Jabbour, Yue Ma, Badran Raddaoui, Lakhdar Sais:
Prime Implicates Based Inconsistency Characterization. ECAI 2014: 1037-1038 - [c74]Saïd Jabbour, Mehdi Khiari, Lakhdar Sais, Yakoub Salhi, Karim Tabia:
Symétries et Extraction de Motifs Ensemblistes. EGC 2014: 407-418 - [c73]Belaïd Benhamou, Saïd Jabbour, Lakhdar Sais, Yakoub Salhi
Symmetry Breaking in Itemset Mining. KDIR 2014: 86-96 - [c72]Belaïd Benhamou, Saïd Jabbour, Lakhdar Sais, Yakoub Salhi
A Generic and Declarative Method for Symmetry Breaking in Itemset Mining. IC3K (Selected Papers) 2014: 143-160 - [c71]Saïd Jabbour, Yue Ma, Badran Raddaoui, Lakhdar Sais:
On the Characterization of Inconsistency: A Prime Implicates Based Framework. ICTAI 2014: 146-153 - [c70]Balasim Al-Saedi, Éric Grégoire, Bertrand Mazure, Lakhdar Sais:
Extensions and Variants of Dalal's Quad Polynomial Fragments of SAT. ICTAI 2014: 446-452 - [c69]Long Guo, Saïd Jabbour, Jerry Lonlac
Diversification by Clauses Deletion Strategies in Portfolio Parallel SAT Solving. ICTAI 2014: 701-708 - [c68]Saïd Jabbour, Jerry Lonlac
Extending modern SAT solvers for models enumeration. IRI 2014: 803-810 - [c67]Mohammad Al-Saedi, Éric Grégoire, Bertrand Mazure, Lakhdar Saïs:
About Some UP-Based Polynomial Fragments of SAT. ISAIM 2014 - [c66]Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi:
A Pigeon-Hole Based Encoding of Cardinality Constraints. ISAIM 2014 - [c65]Saïd Jabbour, João Marques-Silva, Lakhdar Sais, Yakoub Salhi
Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form. JELIA 2014: 152-165 - [i7]Saïd Jabbour, Jerry Lonlac, Lakhdar Sais, Yakoub Salhi:
Revisiting the Learned Clauses Database Reduction Strategies. CoRR abs/1402.1956 (2014) - [i6]Saïd Jabbour, Yue Ma, Badran Raddaoui, Lakhdar Sais, Yakoub Salhi:
On the measure of conflicts: A MUS-Decomposition Based Framework. CoRR abs/1406.0155 (2014) - 2013
- [j14]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi:
A Pigeon-Hole Based Encoding of Cardinality Constraints. Theory Pract. Log. Program. 13(4-5-Online-Supplement) (2013) - [c64]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi
Mining-based compression approach of propositional formulae. CIKM 2013: 289-298 - [c63]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi
Boolean satisfiability for sequence mining. CIKM 2013: 649-658 - [c62]Saïd Jabbour, Mehdi Khiari, Lakhdar Sais, Yakoub Salhi
Symmetry-Based Pruning in Itemset Mining. ICTAI 2013: 483-490 - [c61]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi
The Top-k Frequent Closed Itemset Mining Using Top-k SAT Problem. ECML/PKDD (3) 2013: 403-418 - [c60]Saïd Jabbour, Jerry Lonlac
Adding New Bi-Asserting Clauses for Faster Search in Modern SAT Solvers. SARA 2013 - [i5]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi:
Mining to Compact CNF Propositional Formulae. CoRR abs/1304.4415 (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. Rev. d'Intelligence Artif. 26(1-2): 103-125 (2012) - [c59]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 - [c58]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi
Symmetries in Itemset Mining. ECAI 2012: 432-437 - [c57]Saïd Jabbour, Jerry Lonlac
Extending Resolution by Dynamic Substitution of Boolean Functions. ICTAI 2012: 1029-1034 - [c56]Yakoub Salhi
Graded Modal Logic GS5 and Itemset Support Satisfiability. ISIP 2012: 131-140 - [c55]Saïd Jabbour, Jerry Lonlac
Intensification Search in Modern SAT Solvers - (Poster Presentation). SAT 2012: 491-492 - [p1]Youssef Hamadi, Saïd Jabbour, Lakhdar Sais:
Control-Based Clause Sharing in Parallel SAT Solving. Autonomous Search 2012: 245-267 - [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. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j11]Youssef Hamadi, Saïd Jabbour, Cédric Piette, Lakhdar Sais:
Deterministic Parallel DPLL. J. Satisf. Boolean Model. Comput. 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. Int. J. Artif. Intell. 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]Lakhdar Sais:
Portfolio-based Parallel SAT solving. HPCS 2010: 331 - [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. J. Satisf. Boolean Model. Comput. 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]Youssef Hamadi, Saïd Jabbour, Lakhdar Sais:
Learning for Dynamic Subsumption. ICTAI 2009: 328-335 - [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]Assef Chmeiss, Vincent Krawczyk, Lakhdar Sais:
Redundancy in CSPs. ECAI 2008: 907-908 - [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. J. Satisf. Boolean Model. Comput. 1(3-4): 147-167 (2007) - [j5]Christophe Lecoutre, Lakhdar Sais, Julien Vion:
Using SAT Encodings to Drive CSP Value Ordering Heuristics. J. Satisf. Boolean Model. Comput. 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]Gilles Audemard, Lakhdar Sais:
Circuit Based Encoding of CNF Formula. SAT 2007: 16-21 - 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
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
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
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]Bertrand Mazure, Lakhdar Sais, Éric Grégoire:
Tabu Search for SAT. AAAI/IAAI 1997: 281-285 - [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. Reason. 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
[j29] [c112] [c111] [c110] [j26] [c109] [c107] [j24] [c106] [c105] [i10] [j22] [j21] [c104] [c103] [c102] [c101] [c100] [c99] [i9] [j20] [j18] [c98] [c97] [c96] [c94] [c93] [c92] [c91] [j16] [c90] [c89] [c88] [c87] [c86] [c85] [c84] [c82] [c81] [c80] [c79] [c78] [c77] [c76] [i8] [j15] [c75] [c74] [c73] [c72] [c71] [c69] [c68] [c66] [c65] [i7] [i6] [j14] [c64] [c63] [c62] [c61] [c60] [i5] [i4] [j13] [j12] [c59] [c58] [c57] [c56] [c55] [p1] [j11] [c54] [j10] [c51] [j8] [c45] [c43] [i1] [j7] [c39] [c33]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: