1. Lecture Notes in Computer Science;R Bent,2004
2. Lecture Notes in Computer Science;C Bessiere,2009
3. Coquery, E., Jabbour, S., Saïs, L., Salhi, Y.: A SAT-based approach for discovering frequent, closed and maximal patterns in a sequence. In: Proceedings of the 20th European Conference on Artificial Intelligence (ECAI 2012), Montpellier, France, pp. 258–263. IOS Press (2012)
4. Dechter, R., Dechter, A.: Belief maintenance in dynamic constraint networks. In: Proceedings of the 7th National Conference on Artificial Intelligence (AAAI 1888), St. Paul, MN, pp. 37–42. AAAI Press/The MIT Press (1988)
5. De Raedt, L., Guns, T., Nijssen, S.: Constraint programming for itemset mining. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), Las Vegas, Nevada, pp. 204–212. ACM (2008)