1. Bacchus, F.: The 2000 AI planning systems competition. Artif. Intell. Mag. 22(3), 47–56 (2001)
2. Bailleux, O., Boufkhad, Y.: Efficient CNF encoding of boolean cardinality constraints. In: Proceedings of the 9 th International Conference on Principles and Practice of Constraint Programming (CP’03). Lecture Notes in Computer Science, vol. 2833, pp. 108–122, Kinsale (Ireland). Springer, Berlin Heidelberg New York (2003)
3. Benhamou, B., Saïs, L., Siegel, P.: Two proof procedures for a cardinality based langage in propositional calculus. In: Proceedings of the 11 th Annual Symposium on Theoretical Aspects of Computer Science (STACS’94). Lecture Notes in Computer Science, vol. 775, pp. 71–84, Caen (France). Springer, Berlin Heidelberg New York (1994)
4. Bessiere, C., Regin, J.-C.: Refining the basic constraint propagation algorithm. In: Proceedings of IJCAI01, pp. 309–315 (2001)
5. Bloch, I., Lang, J.: Towards mathematical morphologics. In: Proceedings of the 8 th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU’00), pp. 1405–1412, Madrid (Spain) (2000)