1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.AI2016
A global constraint for closed itemset mining
Mehdi Maamar, Nadjib Lazaar, Samir Loudni +1
Discovering the set of closed frequent patterns is one of the fundamental problems in Data Mining. Recent Constraint Programming (CP) approaches for declarative itemset mining have…
cs.LO2013★ 1 cited
Constraint-based reachability
Arnaud Gotlieb, Tristan Denmat, Nadjib Lazaar
Iterative imperative programs can be considered as infinite-state systems computing over possibly unbounded domains. Studying reachability in these systems is challenging as it req…