1. Handbook of satisfiability,2009
2. SAT-based and CP-based declarative approaches for Top-Rank-K closed frequent itemset mining;Abed;Int. J. Intell. Syst.,2021
3. F. Bacchus, S. Dalmao, T. Pitassi, Algorithms and Complexity Results for #SAT and Bayesian Inference, in: Proceedings of the 44th Symposium on Foundations of Computer Science, 11-14 October 2003, Cambridge, MA, USA, 2003, pp. 340–351.
4. On the hardness of approximate reasoning;Roth;Artificial Intelligence,1996
5. The complexity of enumeration and reliability problems;Valiant;SIAM J. Comput.,1979