default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSaïd Jabbour
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j22]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)- [c93]Saïd Jabbour, Yue Ma, Badran Raddaoui:
Towards a Principle-based Framework for Repair Selection in Inconsistent Knowledge Bases. AAMAS 2024: 907-915 - [c92]Saïd Jabbour, Yue Ma, Badran Raddaoui:
A Principle-based Framework for Repair Selection in Inconsistent Ontologies (Extended Abstract). Description Logics 2024 - [c91]Motaz Ben Hassine, Saïd Jabbour, Mourad Kmimech, Badran Raddaoui, Mohamed Graiet:
On the Discovery of Conceptual Clustering Models Through Pattern Mining. ECAI 2024: 1648-1655 - [c90]Amel Hidouri, Badran Raddaoui, Saïd Jabbour:
Enumération des itemsets rares minimaux à partir des bases de données transactionnelles. EGC 2024: 423-424 - [c89]Badran Raddaoui, Christian Straßer, Saïd Jabbour:
Towards a Principle-based Framework for Assessing the Contribution of Formulas on the Conflicts of Knowledge Bases. IJCAI 2024: 3541-3548 - 2023
- [j21]Amel Hidouri, Saïd Jabbour, Badran Raddaoui, Boutheina Ben Yaghlane:
Corrigendum to "Mining Closed High Utility Itemsets based on Propositional Satisfiability" [Data Knowl. Eng. 136C (2021) 101927]. Data Knowl. Eng. 146: 102200 (2023) - [c88]Saïd Jabbour, Yue Ma, Badran Raddaoui:
Towards Novel Inference Relations based on Logical Argumentation. AI³@AI*IA 2023 - [c87]Jerry Lonlac, Imen Ouled Dlala, Saïd Jabbour, Engelbert Mephu Nguifo, Badran Raddaoui, Lakhdar Sais:
Extracting Frequent Gradual Patterns Based on SAT. DATA 2023: 136-143 - [c86]Motaz Ben Hassine, Saïd Jabbour, Mourad Kmimech, Badran Raddaoui, Mohamed Graiet:
A Non-overlapping Community Detection Approach Based on α-Structural Similarity. DaWaK 2023: 197-211 - [c85]David Ing, Fabien Delorme, Saïd Jabbour, Nelly Robin, Lakhdar Sais:
Classification with Explanation for Human Trafficking Networks. DSAA 2023: 1-10 - [c84]Amel Hidouri, Badran Raddaoui, Saïd Jabbour:
Towards a Unified Symbolic AI Framework for Mining High Utility Itemsets. iiWAS 2023: 77-91 - [c83]Amel Hidouri, Badran Raddaoui, Saïd Jabbour:
Targeting Minimal Rare Itemsets from Transaction Databases. IJCAI 2023: 2114-2121 - [c82]Saïd Jabbour, Badran Raddaoui, Lakhdar Sais:
A Symbolic Approach to Computing Disjunctive Association Rules from Data. IJCAI 2023: 2133-2141 - [c81]Badran Raddaoui, Christian Straßer, Saïd Jabbour:
A Comparative Study of Ranking Formulas Based on Consistency. IJCAI 2023: 3330-3337 - 2022
- [j20]Saïd Jabbour, Yue Ma, Badran Raddaoui:
A Framework for Reasoning About Uncertainty in Ontologies. IEEE Intell. Syst. 37(6): 27-37 (2022) - [j19]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) - [c80]Julien Martin-Prin, Imen Ouled Dlala, Nicolas Travers, Saïd Jabbour:
A Distributed SAT-Based Framework for Closed Frequent Itemset Mining. ADMA (2) 2022: 419-433 - [c79]Saïd Jabbour, Nizar Mhadhbi, Badran Raddaoui, Lakhdar Sais:
A Declarative Framework for Maximal k-plex Enumeration Problems. AAMAS 2022: 660-668 - [c78]Amel Hidouri, Saïd Jabbour, Badran Raddaoui:
On the Enumeration of Frequent High Utility Itemsets: A Symbolic AI Approach. CP 2022: 27:1-27:17 - [c77]Saïd Jabbour, Mourad Kmimech, Badran Raddaoui:
Discovering Overlapping Communities Based on Cohesive Subgraph Models over Graph Data. DaWaK 2022: 189-201 - [c76]Amel Hidouri, Saïd Jabbour, Badran Raddaoui, Mouna Chebbah, Boutheina Ben Yaghlane:
A Parallel Declarative Framework for Mining High Utility Itemsets. IPMU (2) 2022: 624-637 - 2021
- [j18]Amel Hidouri, Saïd Jabbour, Badran Raddaoui, Boutheina Ben Yaghlane:
Mining Closed High Utility Itemsets based on Propositional Satisfiability. Data Knowl. Eng. 136: 101927 (2021) - [c75]Amel Hidouri, Saïd Jabbour, Imen Ouled Dlala, Badran Raddaoui:
On Minimal and Maximal High Utility Itemsets Mining using Propositional Satisfiability. IEEE BigData 2021: 622-628 - [c74]Ikram Nekkache, Saïd Jabbour, Lakhdar Sais, Nadjet Kamel:
Towards a Compact SAT-Based Encoding of Itemset Mining Tasks. CPAIOR 2021: 163-178 - [c73]Amel Hidouri, Saïd Jabbour, Badran Raddaoui, Mouna Chebbah, Boutheina Ben Yaghlane:
A Declarative Framework for Mining Top-k High Utility Itemsets. DaWaK 2021: 250-256 - [c72]Amel Hidouri, Saïd Jabbour, Jerry Lonlac, Badran Raddaoui:
A Constraint-based Approach for Enumerating Gradual Itemsets. ICTAI 2021: 582-589 - 2020
- [j17]Saïd Jabbour, Nizar Mhadhbi, Badran Raddaoui, Lakhdar Sais:
SAT-based models for overlapping community detection in networks. Computing 102(5): 1275-1299 (2020) - [j16]Abderrahim Ait Wakrime, Mouna Rekik, Saïd Jabbour:
Cloud service composition using minimal unsatisfiability and genetic algorithm. Concurr. Comput. Pract. Exp. 32(15) (2020) - [j15]Abderrahim Ait Wakrime, Saïd Jabbour, Nabil Hameurlain:
A MaxSAT based approach for QoS cloud services. Int. J. Parallel Emergent Distributed Syst. 35(6): 641-651 (2020) - [c71]Amel Hidouri, Saïd Jabbour, Badran Raddaoui, Boutheina Ben Yaghlane:
A SAT-Based Approach for Mining High Utility Itemsets from Transaction Databases. DaWaK 2020: 91-106 - [c70]Yacine Izza, Saïd Jabbour, Badran Raddaoui, Abdelhamid Boudane:
On the Enumeration of Association Rules: A Decomposition-based Approach. IJCAI 2020: 1265-1271
2010 – 2019
- 2019
- [c69]Saïd Jabbour, Yue Ma, Badran Raddaoui:
Towards a Prudent Argumentation Framework for Reasoning with Imperfect Ontologies. Description Logics 2019 - [c68]Saïd Jabbour, Nizar Mhadhbi, Badran Raddaoui, Lakhdar Sais:
Représentations compactes des graphes et contraintes pseudo booléennes. EGC 2019: 407-412 - [c67]Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs:
Mining Gradual Itemsets Using Sequential Pattern Mining. FUZZ-IEEE 2019: 1-6 - [c66]Saïd Jabbour, Yue Ma, Badran Raddaoui:
Handling Disagreement in Ontologies-Based Reasoning via Argumentation. WISE 2019: 389-406 - [i8]Jerry Lonlac, Saïd Jabbour, Engelbert Mephu Nguifo, Lakhdar Saïs, Badran Raddaoui:
Extracting Frequent Gradual Patterns Using Constraints Modeling. CoRR abs/1903.08452 (2019) - 2018
- [b1]Saïd Jabbour:
Des Données aux Connaissances : Modèles et Algorithmes. Artois University, Arras, France, 2018 - [j14]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) - [j13]Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs, Yakoub Salhi:
Revisiting the Learned Clauses Database Reduction Strategies. Int. J. Artif. Intell. Tools 27(8): 1850033:1-1850033:19 (2018) - [c65]Saïd Jabbour, Nizar Mhadhbi, Badran Raddaoui, Lakhdar Sais:
Triangle-Driven Community Detection in Large Graphs Using Propositional Satisfiability. AINA 2018: 437-444 - [c64]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 - [c63]Saïd Jabbour, Fatima Ezzahra Mana, Imen Ouled Dlala, Badran Raddaoui, Lakhdar Sais:
On Maximal Frequent Itemsets Mining with Constraints. CP 2018: 554-569 - [c62]Imen Ouled Dlala, Saïd Jabbour, Badran Raddaoui, Lakhdar Sais:
A Parallel SAT-Based Framework for Closed Frequent Itemsets Mining. CP 2018: 570-587 - [c61]Saïd Jabbour, Nizar Mhadhbi, Badran Raddaoui, Lakhdar Sais:
Pushing the Envelope in Overlapping Communities Detection. IDA 2018: 151-163 - [c60]Abdelhamid Boudane, Saïd Jabbour, Badran Raddaoui, Lakhdar Sais:
Efficient SAT-Based Encodings of Conditional Cardinality Constraints. LPAR 2018: 181-195 - [i7]Abdelhamid Boudane, Saïd Jabbour, Badran Raddaoui, Lakhdar Sais:
Efficient Encodings of Conditional Cardinality Constraints. CoRR abs/1804.00211 (2018) - 2017
- [j12]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi:
Mining Top-k motifs with a SAT-based framework. Artif. Intell. 244: 30-47 (2017) - [j11]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) - [c59]Saïd Jabbour, Nizar Mhadhbi, Badran Raddaoui, Lakhdar Sais:
Finding Overlapping Communities in Networks Using Propositional Satisfiability. EDA 2017: 67-80 - [c58]Abdelhamid Boudane, Saïd Jabbour, Lakhdar Sais, Yakoub Salhi:
Une approche logique pour la fouille de règles d'association. EGC 2017: 357-362 - [c57]Soukaina Hattad, Saïd Jabbour, Lakhdar Sais, Yakoub Salhi:
Enhancing Pigeon-Hole based Encoding of Boolean Cardinality Constraints. ICAART (2) 2017: 299-307 - [c56]Abdelhamid Boudane, Saïd Jabbour, Lakhdar Sais, Yakoub Salhi:
Clustering Complex Data Represented as Propositional Formulas. PAKDD (2) 2017: 441-452 - [c55]Saïd Jabbour, Nizar Mhadhbi, Badran Raddaoui, Lakhdar Sais:
A SAT-Based Framework for Overlapping Community Detection in Networks. PAKDD (2) 2017: 786-798 - [c54]Abdelhamid Boudane, Saïd Jabbour, Lakhdar Sais, Yakoub Salhi:
Enumerating Non-redundant Association Rules Using Satisfiability. PAKDD (1) 2017: 824-836 - [c53]Saïd Jabbour, Fatima Zahra Mana, Lakhdar Sais:
On Maximal Frequent Itemsets Enumeration. SoCPaR 2017: 151-160 - [c52]Amel Bouzeghoub, Saïd Jabbour, Yue Ma, Badran Raddaoui:
Handling conflicts in uncertain ontologies using deductive argumentation. WI 2017: 65-72 - [c51]Abderrahim Ait Wakrime, Saïd Jabbour:
Formal Approach for QoS-Aware Cloud Service Composition. WETICE 2017: 30-35 - 2016
- [j10]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) - [c50]Abderrahim Ait Wakrime, Saïd Jabbour:
On repairing queries in cloud computing. AICCSA 2016: 1-6 - [c49]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 - [c48]Saïd Jabbour, Badran Raddaoui, Lakhdar Sais, Yakoub Salhi:
On the Computation of Top-k Extensions in Abstract Argumentation Frameworks. ECAI 2016: 913-920 - [c47]Saïd Jabbour, Lakhdar Sais:
Exploiting MUS Structure to Measure Inconsistency of Knowledge Bases. ECAI 2016: 991-998 - [c46]Saïd Jabbour:
On Inconsistency Measuring and Resolving. ECAI 2016: 1676-1677 - [c45]Saïd Jabbour, Badran Raddaoui, Lakhdar Sais:
Knowledge Base Compilation for Inconsistency Measures. ICAART (2) 2016: 532-539 - [c44]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 - [c43]Saïd Jabbour, Souhila Kaci, Lakhdar Sais, Yakoub Salhi:
Itemset Mining with Penalties. ICTAI 2016: 962-966 - [c42]Abdelhamid Boudane, Saïd Jabbour, Lakhdar Sais, Yakoub Salhi:
A SAT-Based Approach for Mining Association Rules. IJCAI 2016: 2472-2478 - [c41]Saïd Jabbour, Yue Ma, Badran Raddaoui, Lakhdar Sais, Yakoub Salhi:
A MIS Partition Based Framework for Measuring Inconsistency. KR 2016: 84-93 - [c40]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
- [c39]Imen Ouled Dlala, Saïd Jabbour, Lakhdar Sais, Yakoub Salhi, Boutheina Ben Yaghlane:
Parallel SAT based closed frequent itemsets enumeration. AICCSA 2015: 1-8 - [c38]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 - [c37]Saïd Jabbour, Badran Raddaoui, Lakhdar Sais:
Inconsistency-based Ranking of Knowledge Bases. ICAART (2) 2015: 414-419 - [c36]Abderrahim Ait Wakrime, Salima Benbernou, Saïd Jabbour:
Relaxation Based SaaS for Repairing Failed Queries over the Cloud Computing. ICEBE 2015: 245-250 - [c35]Abderrahim Ait Wakrime, Saïd Jabbour:
On QoS web service composition using satisfiability. ICTA 2015: 1-6 - [c34]Saïd Jabbour, Stéphanie Roussel, Lakhdar Sais, Yakoub Salhi:
Mining to Compress Table Constraints. ICTAI 2015: 405-412 - [c33]Abderrahim Ait Wakrime, Saïd Jabbour:
Minimum Unsatisfiability based QoS Web Service Composition over the Cloud Computing. ISDA 2015: 540-545 - [c32]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi:
Decomposition Based SAT Encodings for Itemset Mining Problems. PAKDD (2) 2015: 662-674 - [i6]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi:
On SAT Models Enumeration in Itemset Mining. CoRR abs/1506.02561 (2015) - 2014
- [j9]Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs, Clémentin Tayou Djamégni:
Résolution étendue par substitution dynamique des fonctions booléennes. Rev. d'Intelligence Artif. 28(6): 645-663 (2014) - [c31]Saïd Jabbour, Yue Ma, Badran Raddaoui:
Inconsistency measurement thanks to mus decomposition. AAMAS 2014: 877-884 - [c30]Saïd Jabbour, Yue Ma, Badran Raddaoui, Lakhdar Sais:
Prime Implicates Based Inconsistency Characterization. ECAI 2014: 1037-1038 - [c29]Saïd Jabbour, Mehdi Khiari, Lakhdar Sais, Yakoub Salhi, Karim Tabia:
Symétries et Extraction de Motifs Ensemblistes. EGC 2014: 407-418 - [c28]Belaïd Benhamou, Saïd Jabbour, Lakhdar Sais, Yakoub Salhi:
Symmetry Breaking in Itemset Mining. KDIR 2014: 86-96 - [c27]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 - [c26]Saïd Jabbour, Yue Ma, Badran Raddaoui, Lakhdar Sais:
On the Characterization of Inconsistency: A Prime Implicates Based Framework. ICTAI 2014: 146-153 - [c25]Long Guo, Saïd Jabbour, Jerry Lonlac, Lakhdar Sais:
Diversification by Clauses Deletion Strategies in Portfolio Parallel SAT Solving. ICTAI 2014: 701-708 - [c24]Saïd Jabbour, Jerry Lonlac, Lakhdar Sais, Yakoub Salhi:
Extending modern SAT solvers for models enumeration. IRI 2014: 803-810 - [c23]Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi:
A Pigeon-Hole Based Encoding of Cardinality Constraints. ISAIM 2014 - [c22]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 - [c21]Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Cédric Piette:
An Effective Distributed D&C Approach for the Satisfiability Problem. PDP 2014: 183-187 - [c20]Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Cédric Piette:
Dolius: A Distributed Parallel SAT Solving Framework. POS@SAT 2014: 1-11 - [i5]Saïd Jabbour, Jerry Lonlac, Lakhdar Sais, Yakoub Salhi:
Revisiting the Learned Clauses Database Reduction Strategies. CoRR abs/1402.1956 (2014) - [i4]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
- [j8]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) - [c19]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi, Takeaki Uno:
Mining-based compression approach of propositional formulae. CIKM 2013: 289-298 - [c18]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi:
Boolean satisfiability for sequence mining. CIKM 2013: 649-658 - [c17]Saïd Jabbour, Badran Raddaoui:
Measuring Inconsistency through Minimal Proofs. ECSQARU 2013: 290-301 - [c16]Saïd Jabbour, Mehdi Khiari, Lakhdar Sais, Yakoub Salhi, Karim Tabia:
Symmetry-Based Pruning in Itemset Mining. ICTAI 2013: 483-490 - [c15]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 - [c14]Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs:
Adding New Bi-Asserting Clauses for Faster Search in Modern SAT Solvers. SARA 2013 - [i3]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi:
Mining to Compact CNF Propositional Formulae. CoRR abs/1304.4415 (2013) - [i2]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi:
A Mining-Based Compression Approach for Constraint Satisfaction Problems. CoRR abs/1305.3321 (2013) - 2012
- [j7]Youssef Hamadi, Saïd Jabbour, Lakhdar Sais:
Learning from conflicts in propositional satisfiability. 4OR 10(1): 15-32 (2012) - [j6]Saïd Jabbour, Lakhdar Sais:
Symétries et QBF. Rev. d'Intelligence Artif. 26(1-2): 103-125 (2012) - [c13]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 - [c12]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi, Karim Tabia:
Symmetries in Itemset Mining. ECAI 2012: 432-437 - [c11]Saïd Jabbour, Jerry Lonlac, Lakhdar Sais:
Extending Resolution by Dynamic Substitution of Boolean Functions. ICTAI 2012: 1029-1034 - [c10]Yakoub Salhi, Saïd Jabbour, Lakhdar Sais:
Graded Modal Logic GS5 and Itemset Support Satisfiability. ISIP 2012: 131-140 - [c9]Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Jean-Marie Lagniez, Cédric Piette:
Revisiting Clause Exchange in Parallel SAT Solving. SAT 2012: 200-213 - [c8]Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs:
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 - 2011
- [j5]Youssef Hamadi, Saïd Jabbour, Cédric Piette, Lakhdar Sais:
Deterministic Parallel DPLL. J. Satisf. Boolean Model. Comput. 7(4): 127-132 (2011) - [c7]Emmanuel Coquery, Saïd Jabbour, Lakhdar Sais:
A Constraint Programming Approach for Enumerating Motifs in a Sequence. ICDM Workshops 2011: 1091-1097 - 2010
- [j4]Saïd Jabbour:
Learning from successes. Int. J. Artif. Intell. Tools 19(4): 373-391 (2010) - [j3]Youssef Hamadi, Saïd Jabbour, Lakhdar Sais:
Learning for Dynamic Subsumption. Int. J. Artif. Intell. Tools 19(4): 511-529 (2010) - [c6]Long Guo, Youssef Hamadi, Saïd Jabbour, Lakhdar Sais:
Diversification and Intensification in Parallel SAT Solving. CP 2010: 252-265
2000 – 2009
- 2009
- [j2]Youssef Hamadi, Saïd Jabbour, Lakhdar Sais:
ManySAT: a Parallel SAT Solver. J. Satisf. Boolean Model. Comput. 6(4): 245-262 (2009) - [c5]Youssef Hamadi, Saïd Jabbour, Lakhdar Sais:
Learning for Dynamic Subsumption. ICTAI 2009: 328-335 - [c4]Saïd Jabbour:
Learning for Dynamic Assignments Reordering. ICTAI 2009: 336-343 - [c3]Youssef Hamadi, Saïd Jabbour, Lakhdar Sais:
Control-Based Clause Sharing in Parallel SAT Solving. IJCAI 2009: 499-504 - [i1]Youssef Hamadi, Saïd Jabbour, Lakhdar Sais:
Learning for Dynamic subsumption. CoRR abs/0904.0029 (2009) - 2008
- [j1]Gilles Audemard, Saïd Jabbour, Lakhdar Sais:
SAT graph-based representation: A new perspective. J. Algorithms 63(1-3): 17-33 (2008) - [c2]Gilles Audemard, Lucas Bordeaux, Youssef Hamadi, Saïd Jabbour, Lakhdar Sais:
A Generalized Framework for Conflict Analysis. SAT 2008: 21-27 - 2007
- [c1]Gilles Audemard, Saïd Jabbour, Lakhdar Sais:
Symmetry Breaking in Quantified Boolean Formulae. IJCAI 2007: 2262-2267
Coauthor Index
[j22] [c93] [c92] [c91] [c90] [c89] [j21] [c88] [c87] [c86] [c84] [c83] [c82] [c81] [j20] [c79] [c78] [c77] [c76] [j18] [c75] [c73] [c72] [j17] [c71] [c70] [c69] [c68] [c66] [i8] [c65] [c64] [c63] [c62] [c61] [c60] [i7] [j11] [c59] [c55] [c52] [c49] [c48] [c45] [c44] [c41] [c38] [c37] [c31] [c30] [c26] [i4] [c17]
Lakhdar Sais
aka: Lakhdar Saïs
aka: Lakhdar Saïs
[j22] [c87] [c85] [c82] [j19] [c79] [c74] [j17] [c68] [c67] [i8] [j14] [j13] [c65] [c64] [c63] [c62] [c61] [c60] [i7] [j12] [j11] [c59] [c58] [c57] [c56] [c55] [c54] [c53] [j10] [c49] [c48] [c47] [c45] [c44] [c43] [c42] [c41] [c40] [c39] [c38] [c37] [c34] [c32] [i6] [j9] [c30] [c29] [c28] [c27] [c26] [c25] [c24] [c23] [c22] [i5] [i4] [j8] [c19] [c18] [c16] [c15] [c14] [i3] [i2] [j7] [j6] [c13] [c12] [c11] [c10] [c8] [p1] [j5] [c7] [j3] [c6] [j2] [c5] [c3] [i1] [j1] [c2] [c1]
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-08 21:31 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:
