Discovering Overlapping Communities Based on Cohesive Subgraph Models over Graph Data von Jabbour, Said, Kmimech, Mourad, Raddaoui, Badran

Volltext

A non-overlapping community detection approach based on α-structural similarity von Hassine, Motaz Ben, Jabbour, Saïd, Kmimech, Mourad, Raddaoui, Badran, Graiet, Mohamed

Volltext

What we can learn from conflicts in propositional satisfiability von Hamadi, Youssef, Jabbour, Saïd, Saïs, Lakhdar

Volltext

Towards a Unified Symbolic AI Framework for Mining High Utility Itemsets von Hidouri, Amel, Raddaoui, Badran, Jabbour, Said

Volltext

Handling Disagreement in Ontologies-Based Reasoning via Argumentation von Jabbour, Said, Ma, Yue, Raddaoui, Badran

Volltext

Diversification and Intensification in Parallel SAT Solving von Guo, Long, Hamadi, Youssef, Jabbour, Said, Sais, Lakhdar

Volltext

A Parallel SAT-Based Framework for Closed Frequent Itemsets Mining von Dlala, Imen Ouled, Jabbour, Said, Raddaoui, Badran, Sais, Lakhdar

Volltext

Pushing the Envelope in Overlapping Communities Detection von Jabbour, Said, Mhadhbi, Nizar, Raddaoui, Badran, Sais, Lakhdar

Volltext

On the Discovery of Frequent Gradual Patterns: A Symbolic AI-Based Framework von Lonlac, Jerry, Ouled Dlala, Imen, Jabbour, Saïd, Mephu Nguifo, Engelbert, Raddaoui, Badran, Saïs, Lakhdar

Volltext

Learning from conflicts in propositional satisfiability von Hamadi, Youssef, Jabbour, Saïd, Saïs, Lakhdar

Volltext

A Framework for Reasoning About Uncertainty in Ontologies von Jabbour, Said, Ma, Yue, Raddaoui, Badran

Volltext

Corrigendum to “Mining Closed High Utility Itemsets based on Propositional Satisfiability” [Data Knowl. Eng. 136C (2021) 101927] von Hidouri, Amel, Jabbour, Said, Raddaoui, Badran, Ben Yaghlane, Boutheina

Volltext

Mining Top-k motifs with a SAT-based framework von Jabbour, Said, Sais, Lakhdar, Salhi, Yakoub

Volltext

A SAT-Based Framework for Overlapping Community Detection in Networks von Jabbour, Said, Mhadhbi, Nizar, Raddaoui, Badran, Sais, Lakhdar

Volltext

Mining Closed High Utility Itemsets based on Propositional Satisfiability von Hidouri, Amel, Jabbour, Said, Raddaoui, Badran, Ben Yaghlane, Boutheina

Volltext

Quantifying conflicts in propositional logic through prime implicates von Jabbour, Said, Ma, Yue, Raddaoui, Badran, Sais, Lakhdar

Volltext

SAT-based models for overlapping community detection in networks von Jabbour, Said, Mhadhbi, Nizar, Raddaoui, Badran, Sais, Lakhdar

Volltext

Cloud service composition using minimal unsatisfiability and genetic algorithm von Ait Wakrime, Abderrahim, Rekik, Mouna, Jabbour, Said

Volltext

Mining Negatives Association Rules Using Constraints von Jabbour, Said, El Mazouri, Fatima Ezzahra, Sais, Lakhdar

Volltext

Towards a Compact SAT-Based Encoding of Itemset Mining Tasks von Nekkache, Ikram, Jabbour, Said, Sais, Lakhdar, Kamel, Nadjet

Volltext