Decomposition Based SAT Encodings for Itemset Mining Problems
- 9 May 2015
- book chapter
- Published by Springer Nature
- p. 662-674
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Extending modern SAT solvers for models enumeration2014
- The Top-k Frequent Closed Itemset Mining Using Top-k SAT ProblemLecture Notes in Computer Science, 2013
- A Constraint-Based Language for Declarative Pattern Discovery2011
- Itemset mining: A constraint programming perspectiveArtificial Intelligence, 2011
- Cardinality Networks: a theoretical and empirical studyConstraints, 2011
- Combining CSP and Constraint-Based Mining for Pattern Discovery2010
- Towards Robust CNF Encodings of Cardinality Constraints2007
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints2005
- The complexity of mining maximal frequent itemsets and maximal frequent patterns2004
- On the Complexity of Derivation in Propositional Calculus1970