Mining top-\(k\) motifs with a SAT-based framework

DOI10.1016/j.artint.2015.11.003zbMath1404.68143OpenAlexW2182849704MaRDI QIDQ511756

Yakoub Salhi, Saïd Jabbour, Lakhdar Saïs

Publication date: 22 February 2017

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2015.11.003

zbMATH Keywords

modelingdata miningBoolean satisfiabilitytop-\(k\) motifs

Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Implementing Efficient All Solutions SAT Solvers

Uses Software

• MiniSat
• CP-nets

Cites Work

• Cardinality networks: a theoretical and empirical study
• Solving satisfiability problems with preferences
• Itemset mining: a constraint programming perspective
• An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
• On measuring similarity for sequences of itemsets
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
• Mining (Soft-) Skypatterns Using Dynamic CSP
• On Solving the Partial MAX-SAT Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item