SABIO: An implementation of MIP and CP for interactive soccer queries

Loading...
Thumbnail Image
Files
cp-2016-paper_114.pdf(556.66 KB)
Accepted Version
Date
2016-08-23
Authors
Duque, Robinson
Díaz, Juan Francisco
Arbelaez, Alejandro
Journal Title
Journal ISSN
Volume Title
Publisher
Springer Nature Ltd.
Research Projects
Organizational Units
Journal Issue
Abstract
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.
Description
Keywords
Constraint programming , Boolean variable , Redundant constraint , Elimination problem , Constraint programming model
Citation
Duque, R., Díaz, J. F. and Arbelaez, A. (2016) 'SABIO: An implementation of MIP and CP for interactive soccer queries', in Rueher, M. (ed) Principles and Practice of Constraint Programming, pp. 575-583. CP 2016. Lecture Notes in Computer Science, 9892. Springer, Cham. https://doi.org/10.1007/978-3-319-44953-1_36
Copyright
© 2016, Springer International Publishing Switzerland. This version of the paper has been accepted for publication, after peer review (when applicable) and is subject to Springer Nature’s AM terms of use, but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: https://doi.org/10.1007/978-3-319-44953-1_36