activity
20142026
most citedTowards Learned Clauses Database Reduction Strategies Based on Dominance Relationship

2 citations · 5 across the 5 of their papers we have counts for

collaborators

6 papers

cs.LG2026

DAStatFormer: A Hybrid Multibranch Transformer with Statistical Feature Integration for DAS-Based Pattern Recognitions

Michel Dione, Jerry Lonlac, Hélène Louis +2

Distributed Acoustic Sensing (DAS) enables large-scale monitoring through optical fibers, but its high dimensionality and complex spatio-temporal patterns make event classification…

cs.LG2020★ 1 cited

Extracting Seasonal Gradual Patterns from Temporal Sequence Data Using Periodic Patterns Mining

Jerry Lonlac, Arnaud Doniec, Marin Lujak +1

Mining frequent episodes aims at recovering sequential patterns from temporal data sequences, which can then be used to predict the occurrence of related events in advance. On the…

cs.LG2020★ 1 cited

Discovering Frequent Gradual Itemsets with Imprecise Data

Michaël Chirmeni Boujike, Jerry Lonlac, Norbert Tsopze +1

The gradual patterns that model the complex co-variations of attributes of the form "The more/less X, The more/less Y" play a crucial role in many real world applications where the…

cs.AI2019★ 1 cited

Extracting Frequent Gradual Patterns Using Constraints Modeling

Jerry Lonlac, Saïdd Jabbour, Engelbert Mephu Nguifo +2

In this paper, we propose a constraint-based modeling approach for the problem of discovering frequent gradual patterns in a numerical dataset. This SAT-based declarative approach…

cs.AI2017★ 2 cited

Towards Learned Clauses Database Reduction Strategies Based on Dominance Relationship

Jerry Lonlac, Engelbert Mephu Nguifo

Clause Learning is one of the most important components of a conflict driven clause learning (CDCL) SAT solver that is effective on industrial instances. Since the number of learne…

cs.AI2014

Revisiting the Learned Clauses Database Reduction Strategies

Said Jabbour, Jerry Lonlac, Lakhdar Sais +1

In this paper, we revisit an important issue of CDCL-based SAT solvers, namely the learned clauses database management policies. Our motivation takes its source from a simple obser…