{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T04:04:55Z","timestamp":1780373095817,"version":"3.54.1"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032272416","type":"print"},{"value":"9783032272423","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-27242-3_14","type":"book-chapter","created":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T03:24:59Z","timestamp":1780370699000},"page":"225-242","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["No-Opponent-Cycle Propagators for\u00a0Solving Parity Games"],"prefix":"10.1007","author":[{"given":"Gonzalo","family":"Hernandez","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Julian","family":"Garcia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Julian","family":"Gutierrez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guido","family":"Tack","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,1]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1007\/978-3-031-30823-9_34","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Aggarwal","year":"2023","unstructured":"Aggarwal, S., de la Banda, A.S., Yang, L., Gutierrez, J.: A matrix-based approach to parity games. In: Sankaranarayanan, S., Sharygina, N. (eds.) Tools and Algorithms for the Construction and Analysis of Systems, pp. 666\u2013683. Springer, Cham (2023)"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-319-41540-6_15","volume-title":"Computer Aided Verification","author":"M Benerecetti","year":"2016","unstructured":"Benerecetti, M., Dell\u2019Erba, D., Mogavero, F.: Solving parity games via priority promotion. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9780, pp. 270\u2013290. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41540-6_15"},{"key":"14_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2024.103580","volume":"147","author":"M Benerecetti","year":"2025","unstructured":"Benerecetti, M., Dell\u2019Erba, D., Mogavero, F., Schewe, S., Wojtczak, D.: Priority promotion with parysian flair. J. Comput. Syst. Sci. 147, 103580 (2025). https:\/\/doi.org\/10.1016\/j.jcss.2024.103580","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR4","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-031-65627-9_7","volume-title":"CAV 2024, Part I","author":"A Biere","year":"2024","unstructured":"Biere, A., Faller, T., Fazekas, K., Fleury, M., Froleyks, N., Pollitt, F.: CaDiCaL 2.0. In: Gurfinkel, A., Ganesh, V. (eds.) CAV 2024, Part I. LNCS, vol. 14681, pp. 133\u2013152. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-65627-9_7"},{"key":"14_CR5","unstructured":"Biere, A., Faller, T., Fazekas, K., Fleury, M., Froleyks, N., Pollitt, F.: CaDiCaL, Gimsatul, IsaSAT and Kissat entering the SAT Competition 2024. In: Heule, M., Iser, M., J\u00e4rvisalo, M., Suda, M. (eds.) Proc. of SAT Competition 2024 - Solver, Benchmark and Proof Checker Descriptions. Department of Computer Science Report Series B, vol. B-2024-1, pp. 8\u201310. University of Helsinki (2024)"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.tcs.2020.10.002","volume":"847","author":"L Bozzelli","year":"2020","unstructured":"Bozzelli, L., Murano, A., Perelli, G., Sorrentino, L.: Hierarchical cost-parity games. Theoret. Comput. Sci. 847, 147\u2013174 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2020.10.002","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR7","doi-asserted-by":"publisher","unstructured":"Brihaye, T., Bruy\u00e8re, V., Goeminne, A., Thomasset, N.: On relevant equilibria in reachability games. J. Comput. Syst. Sci. 119, 211\u2013230 (2021). https:\/\/doi.org\/10.1016\/j.jcss.2021.02.009","DOI":"10.1016\/j.jcss.2021.02.009"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Bruy\u00e8re, V.: A game-theoretic approach for the synthesis of complex systems. In: Revolutions and Revelations in Computability. LNCS, vol. 13359, pp. 52\u201363. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-08740-0_5"},{"key":"14_CR9","doi-asserted-by":"publisher","unstructured":"Chatterjee, K., Doyen, L.: Energy parity games. Theoret. Comput. Sci. 458, 49\u201360 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2012.07.038","DOI":"10.1016\/j.tcs.2012.07.038"},{"issue":"2","key":"14_CR10","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/j.jcss.2011.05.002","volume":"78","author":"K Chatterjee","year":"2012","unstructured":"Chatterjee, K., Henzinger, T.A.: A survey of stochastic $$\\omega $$-regular games. J. Comput. Syst. Sci. 78(2), 394\u2013413 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR11","unstructured":"Chu, G., Stuckey, P.J.: Chuffed: a lazy clause generation constraint solver. GitHub repository (2018). https:\/\/github.com\/chuffed\/chuffed"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Cotton, S., Asarin, E., Maler, O., Niebert, P., Yovine, S., Lakhnech, Y.: Some progress in satisfiability checking for difference logic. In: Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems, pp. 263\u2013276 (2004)","DOI":"10.1007\/978-3-540-30206-3_19"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-319-89960-2_16","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T Dijk","year":"2018","unstructured":"Dijk, T.: Oink: an implementation and evaluation of modern parity game solvers. In: Beyer, D., Huisman, M. (eds.) TACAS 2018. LNCS, vol. 10805, pp. 291\u2013308. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89960-2_16"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502\u2013518. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24605-3_37"},{"key":"14_CR15","doi-asserted-by":"publisher","unstructured":"Fijalkow, N., Zimmermann, M.: Parity and Streett games with costs. Log. Methods Comput. Sci. 10(2) (2014). https:\/\/doi.org\/10.2168\/lmcs-10(2:14)2014","DOI":"10.2168\/lmcs-10(2:14)2014"},{"key":"14_CR16","doi-asserted-by":"publisher","unstructured":"Finkbeiner, B., Hahn, C., Stenger, M., Tentrup, L.: Synthesizing reactive systems from hyperproperties. In: CAV 2018. LNCS, vol. 10981, pp. 158\u2013175. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96145-3_9","DOI":"10.1007\/978-3-319-96145-3_9"},{"key":"14_CR17","unstructured":"Friedmann, O., Lange, M.: The PGSolver Collection of Parity Game Solvers, Version 4.1 (2017). https:\/\/github.com\/tcsprojects\/pgsolver\/blob\/master\/doc\/pgsolver.pdf. Accessed 13 Mar 2025"},{"key":"14_CR18","doi-asserted-by":"publisher","unstructured":"Heljanko, K., Kein\u00e4nen, M., Lange, M., Niemel\u00e4, I.: Solving parity games by a reduction to SAT. J. Comput. Syst. Sci. 78(2), 430\u2013440 (2012). https:\/\/doi.org\/10.1016\/j.jcss.2011.05.004. Games in Verification","DOI":"10.1016\/j.jcss.2011.05.004"},{"key":"14_CR19","unstructured":"Hernandez, G., Garcia, J., Gutierrez, J., Tack, G.: Implementation and evaluation of no-opponent-cycle propagators for solving parity games (2025). https:\/\/github.com\/GonzaloHernandez\/NoOpponentCycle. Version 1.0"},{"key":"14_CR20","doi-asserted-by":"publisher","unstructured":"Hernandez, G., Garcia, J., Gutierrez, J., Tack, G.: NOC propagators for solving parity games - appendix. Figshare (2025). https:\/\/doi.org\/10.6084\/m9.figshare.30842819. Online supplement","DOI":"10.6084\/m9.figshare.30842819"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-46541-3_24","volume-title":"STACS 2000","author":"M Jurdzi\u0144ski","year":"2000","unstructured":"Jurdzi\u0144ski, M.: Small progress measures for solving parity games. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 290\u2013301. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-46541-3_24"},{"issue":"3","key":"14_CR22","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0020-0190(98)00150-1","volume":"68","author":"M Jurdzi\u0144ski","year":"1998","unstructured":"Jurdzi\u0144ski, M.: Deciding the winner in parity games is in UP $$\\cap $$ co-UP. Inf. Process. Lett. 68(3), 119\u2013124 (1998)","journal-title":"Inf. Process. Lett."},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Jurdzi\u0144ski, M., Morvan, R., Thejaswini, K.S.: Universal algorithms for parity games and nested fixpoints. In: LNCS, pp. 252\u2013271. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-22337-2_12"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Keiren, J. J. A.: Benchmarks for parity games (extended version) (2015). https:\/\/arxiv.org\/abs\/1407.3121","DOI":"10.1007\/978-3-319-24644-4_9"},{"issue":"1\u20132","key":"14_CR25","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00236-019-00349-3","volume":"57","author":"M Luttenberger","year":"2020","unstructured":"Luttenberger, M., Meyer, P.J., Sickert, S.: Practical synthesis of reactive systems from LTL specifications via parity games: you can teach an old dog new tricks: making a classic approach structured, forward-explorative, and incremental. Acta Informatica 57(1\u20132), 3\u201336 (2020)","journal-title":"Acta Informatica"},{"issue":"3","key":"14_CR26","doi-asserted-by":"publisher","first-page":"277","DOI":"10.3233\/FI-2015-1235","volume":"139","author":"F Mogavero","year":"2015","unstructured":"Mogavero, F., Murano, A., Sorrentino, L.: On promptness in parity games. Fund. Inform. 139(3), 277\u2013305 (2015). https:\/\/doi.org\/10.3233\/FI-2015-1235","journal-title":"Fund. Inform."},{"key":"14_CR27","doi-asserted-by":"publisher","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proceedings of the 38th Annual Design Automation Conference (DAC 2001), pp. 530\u2013535. ACM (2001). https:\/\/doi.org\/10.1145\/378239.379017","DOI":"10.1145\/378239.379017"},{"key":"14_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-540-74970-7_38","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"N Nethercote","year":"2007","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: towards a standard CP modelling language. In: Bessi\u00e8re, C. (ed.) Principles and Practice of Constraint Programming \u2013 CP 2007. LNCS, vol. 4741, pp. 529\u2013543. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74970-7_38"},{"issue":"3","key":"14_CR29","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/S10601-008-9064-X","volume":"14","author":"O Ohrimenko","year":"2009","unstructured":"Ohrimenko, O., Stuckey, P.J., Codish, M.: Propagation via lazy clause generation. Constraints An Int. J. 14(3), 357\u2013391 (2009). https:\/\/doi.org\/10.1007\/S10601-008-9064-X","journal-title":"Constraints An Int. J."},{"issue":"2","key":"14_CR30","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"key":"14_CR31","doi-asserted-by":"crossref","unstructured":"Weinert, A., Zimmermann, M.: Easy to win, hard to master: optimal strategies in parity games with costs. Log. Methods Comput. Sci. (2016). https:\/\/api.semanticscholar.org\/CorpusID:1611141","DOI":"10.23638\/LMCS-13(3:29)2017"},{"issue":"1","key":"14_CR32","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(98)00009-7","volume":"200","author":"W Zielonka","year":"1998","unstructured":"Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoret. Comput. Sci. 200(1), 135\u2013183 (1998)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-27242-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T03:25:06Z","timestamp":1780370706000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27242-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032272416","9783032272423"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27242-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"1 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rabat","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2026\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}