On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability.
Iyad A. KanjDimitrios M. ThilikosGe XiaPublished in: Inf. Comput. (2017)
Keyphrases
- anti monotone
- parameterized complexity
- symmetry breaking
- itemsets
- frequent itemsets
- pruning strategy
- frequent patterns
- fixed parameter tractable
- high utility
- np complete
- answer sets
- fixpoint
- satisfiability problem
- propositional logic
- computational complexity
- frequent pattern mining
- global constraints
- sat problem
- constraint programming
- logic programs