{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:53:24Z","timestamp":1772297604895,"version":"3.50.1"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319449524","type":"print"},{"value":"9783319449531","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44953-1_36","type":"book-chapter","created":{"date-parts":[[2016,8,22]],"date-time":"2016-08-22T15:12:23Z","timestamp":1471878743000},"page":"575-583","source":"Crossref","is-referenced-by-count":1,"title":["SABIO: An Implementation of MIP and CP for Interactive Soccer Queries"],"prefix":"10.1007","author":[{"given":"Robinson","family":"Duque","sequence":"first","affiliation":[]},{"given":"Juan Francisco","family":"D\u00edaz","sequence":"additional","affiliation":[]},{"given":"Alejandro","family":"Arbelaez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,23]]},"reference":[{"issue":"3","key":"36_CR1","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1137\/1008062","volume":"8","author":"BL Schwartz","year":"1966","unstructured":"Schwartz, B.L.: Possible winners in partially completed tournaments. SIAM Rev. 8(3), 302\u2013308 (1966)","journal-title":"SIAM Rev."},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Hoffman, A., Rivlin, T.: When is a team \u201cmathematically\u201d eliminated? In: Princeton Symposium on Mathematical Programming, pp. 391\u2013401. Princeton, NJ (1967)","DOI":"10.1515\/9781400869930-023"},{"issue":"3","key":"36_CR3","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0166-218X(00)00241-9","volume":"108","author":"W Kern","year":"2001","unstructured":"Kern, W., Paulusma, D.: The new FIFA rules are hard: complexity aspects of sports competitions. Discrete Appl. Math. 108(3), 317\u2013323 (2001)","journal-title":"Discrete Appl. Math."},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Bernholt, T., G\u00e4lich, A., Hofmeister, T., Schmitt, N.: Football elimination is hard to decide under the 3-point-rule. In: MFCS, pp. 410\u2013418 (1999)","DOI":"10.1007\/3-540-48340-3_37"},{"issue":"2","key":"36_CR5","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1137\/S0895480198348847","volume":"14","author":"KD Wayne","year":"2001","unstructured":"Wayne, K.D.: A new property and a faster algorithm for baseball elimination. SIAM J. Discrete Math. 14(2), 223\u2013229 (2001)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"36_CR6","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/j.disopt.2003.12.003","volume":"1","author":"W Kern","year":"2004","unstructured":"Kern, W., Paulusma, D.: The computational complexity of the elimination problem in generalized sports competitions. Discrete Optim. 1(2), 205\u2013214 (2004)","journal-title":"Discrete Optim."},{"issue":"1","key":"36_CR7","first-page":"35","volume":"1","author":"D P\u00e1lv\u00f6lgyi","year":"2009","unstructured":"P\u00e1lv\u00f6lgyi, D.: Deciding soccer scores and partial orientations of graphs. Acta Univ. Sapientiae 1(1), 35\u201342 (2009)","journal-title":"Acta Univ. Sapientiae"},{"issue":"4","key":"36_CR8","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1111\/j.1475-3995.2005.00513.x","volume":"12","author":"CC Ribeiro","year":"2005","unstructured":"Ribeiro, C.C., Urrutia, S.: An application of integer programming to playoff elimination in football championships. Int. Trans. Oper. Res. 12(4), 375\u2013386 (2005)","journal-title":"Int. Trans. Oper. Res."},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Duque, R., D\u00edaz, J.F., Arbelaez, A.: Constraint programming and machine learning for interactive soccer analysis. In: LION 10 (2016, to appear)","DOI":"10.1007\/978-3-319-50349-3_18"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Arbelaez, A., Hamadi, Y.: Exploiting weak dependencies in tree-based search. In: SAC 2009, pp. 1385\u20131391 (2009)","DOI":"10.1145\/1529282.1529592"},{"key":"36_CR11","unstructured":"Haralick, R.M., Elliott, G.L.: Increasing tree search efficiency for constraint satisfaction problems. In: IJCAI 1979, San Francisco, CA, USA, pp. 356\u2013364 (1979)"},{"key":"36_CR12","unstructured":"Borrett, J., Tsang, E.P., Walsh, N.R.: Adaptive constraint satisfaction: the quickest first principle. In: European Conference on Artificial Intelligence (1996)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44953-1_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T21:12:58Z","timestamp":1568322778000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44953-1_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319449524","9783319449531"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44953-1_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}