SABIO: An Implementation of MIP and CP for Interactive Soccer Queries
Soccer is one of the most popular sports in the world with millions of fans that usually raise interesting questions when the competition is partially completed. One interesting question relates to the elimination problem which consists in checking at some stage of the competition if a team i still has a theoretical chance to become the champion. Some other interesting problems from literature are the guaranteed qualification problem, the possible qualification problem, the score vector problem, promotion and relegation. These problems are NP-complete for the actual FIFA pointing rule system (0 points-loss, 1 point-tie, 3 points-win). SABIO is an online platform that helps users discover information related to soccer by letting them formulate questions in form of constraints and go beyond the classical soccer computational problems. In the paper we considerably improve the performance of an existing CP model and combine the use of MIP and CP to answer general soccer queries in a real-time application.
KeywordsConstraint Programming Boolean Variable Redundant Constraint Elimination Problem Constraint Programming Model
We would like to thank Luis F. Vargas, María A. Cruz and Carlos Martínez for developing early versions of the CP model under the supervision of Juan F. Díaz. Robinson Duque is supported by Colciencias under the PhD scholarship program. Alejandro Arbelaez is supported by SFI Grant No. 10/CE/I1853.
- 2.Hoffman, A., Rivlin, T.: When is a team “mathematically” eliminated? In: Princeton Symposium on Mathematical Programming, pp. 391–401. Princeton, NJ (1967)Google Scholar
- 4.Bernholt, T., Gälich, A., Hofmeister, T., Schmitt, N.: Football elimination is hard to decide under the 3-point-rule. In: MFCS, pp. 410–418 (1999)Google Scholar
- 9.Duque, R., Díaz, J.F., Arbelaez, A.: Constraint programming and machine learning for interactive soccer analysis. In: LION 10 (2016, to appear)Google Scholar
- 10.Arbelaez, A., Hamadi, Y.: Exploiting weak dependencies in tree-based search. In: SAC 2009, pp. 1385–1391 (2009)Google Scholar
- 11.Haralick, R.M., Elliott, G.L.: Increasing tree search efficiency for constraint satisfaction problems. In: IJCAI 1979, San Francisco, CA, USA, pp. 356–364 (1979)Google Scholar
- 12.Borrett, J., Tsang, E.P., Walsh, N.R.: Adaptive constraint satisfaction: the quickest first principle. In: European Conference on Artificial Intelligence (1996)Google Scholar