A SAT-Based Framework for Overlapping Community Detection in Networks

Jabbour, Saïd; Mhadhbi, Nizar; Raddaoui, Badran; Saïs, Lakhdar

doi:10.1007/978-3-319-57529-2_61

Cited by 11 publications

(6 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the left branch, we first apply the the expansion rule of weak disjunction to (4), obtaining ( 10) and ( 11) and then derive the contradictions ( 12) and ( 13). On the right branch, we first apply the the expansion rule of weak disjunction to (4), obtaining ( 14) and ( 15) and then derive the contradictions (16)(17) and (18)(19). Note that now each branch is saturated and the tableau is completed.…”

Section: Derivation Of Contradictionsmentioning

confidence: 99%

“…From a problem solving perspective, MaxSAT is seen as a competitive generic problem solving formalisms for combinatorial optimization, as witnessed by a range of realworld applications as diverse as bioinformatics [27], community detection in complex networks [19], combinatorial testing [4], FPGA routing [29], planning [30], scheduling [11] and team formation [26], among many others.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Tableaux for Maximum Satisfiability in Łukasiewicz Logic

Li¹,

Manyà²,

Vidal³

2020

2020 IEEE 50th International Symposium on Multiple-Valued Logic (ISMVL)

View full text Add to dashboard Cite

show abstract

Section: Derivation Of Contradictionsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Tableaux for Maximum Satisfiability in Łukasiewicz Logic

Li¹,

Manyà²,

Vidal³

2020

2020 IEEE 50th International Symposium on Multiple-Valued Logic (ISMVL)

View full text Add to dashboard Cite

show abstract

“…Thus the user specifies what the problem with the different constraints required and a general purpose solver determines how to solve the problem. This strategy is inspired by a recent work on finding the best k-linked centred communities in a network using SAT problem [31]. In the following subsection, we introduce our SAT-based encoding, which enables to discover the cohesive subgraphs as the set of overlapping communities for a given large graph.…”

Section: Triangle-driven Community Detection Using Satisfiability Pro...mentioning

confidence: 99%

Triangle-Driven Community Detection in Large Graphs Using Propositional Satisfiability

Jabbour¹,

Mhadbhi²,

Raddaoui³

et al. 2018

2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)

Self Cite

View full text Add to dashboard Cite

Discovering the latent community structure is crucial to understanding the features of networks. Several approaches have been proposed to solve this challenging problem using different measures or data structures. Among them, detecting overlapping communities in a network is an usual way towards network structure discovery. It presents nice algorithmic issues, and plays an important role in complex network analysis. In this paper, we propose a new approach to detect overlapping communities in large complex networks. First, we introduce a novel subgraph concept based on triangles to capture the cohesion in social interactions, and propose an efficient approach to discover clusters in networks. Next, we show how the problem of detecting overlapping communities can be expressed as a Partial Max-SAT optimization problem. Our comprehensive experimental evaluation on publicly available real-life networks with ground-truth communities demonstrates the effectiveness and efficiency of our proposed method.

show abstract

“…Although this work is mainly theoretical, it is worth mentioning that MaxSAT offers a competitive generic problem solving formalism for combinatorial optimization. For example, MaxSAT has been applied to solve optimization problems in real-world domains as diverse as combinatorial testing [1], community detection in complex networks [17],…”

Section: Introductionmentioning

confidence: 99%

A Tableau Calculus for MaxSAT Based on Resolution

Coll

Habet

et al. 2022

Frontiers in Artificial Intelligence and Applications

View full text Add to dashboard Cite

We define a new MaxSAT tableau calculus based on resolution. Given a multiset of propositional clauses ϕ, we prove that the calculus is sound in the sense that if the minimum number of contradictions derived among the branches of a completed tableau for ϕ is m, then the minimum number of unsatisfied clauses in ϕ is m. We also prove that it is complete in the sense that if the minimum number of unsatisfied clauses in ϕ is m, then the minimum number of contradictions among the branches of any completed tableau for ϕ is m. Moreover, we describe how to extend the proposed calculus to solve Weighted Partial MaxSAT.

show abstract

A SAT-Based Framework for Overlapping Community Detection in Networks

Cited by 11 publications

References 19 publications

Tableaux for Maximum Satisfiability in Łukasiewicz Logic

Tableaux for Maximum Satisfiability in Łukasiewicz Logic

Triangle-Driven Community Detection in Large Graphs Using Propositional Satisfiability

A Tableau Calculus for MaxSAT Based on Resolution

Contact Info

Product

Resources

About