{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:17:48Z","timestamp":1740122268396,"version":"3.37.3"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T00:00:00Z","timestamp":1726185600000},"content-version":"vor","delay-in-days":104,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"crossref","award":["EP\/V027182\/1","EP\/W001977\/1"],"award-info":[{"award-number":["EP\/V027182\/1","EP\/W001977\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["MCIN\/AEI\/10.13039\/501100011033 grant PID2021-122274OB-I00"],"award-info":[{"award-number":["MCIN\/AEI\/10.13039\/501100011033 grant PID2021-122274OB-I00"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2024,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We study a planning problem based on Plotting, a tile-matching puzzle video game published by Taito in 1989. The objective of this turn-based game is to remove a target number of coloured blocks from a grid by sequentially shooting blocks into the same grid. Plotting features complex transitions after every shot: various blocks are affected directly, while others can be indirectly affected by gravity. We consider modelling and solving Plotting from two perspectives. The puzzle is naturally cast as an AI Planning problem and we first discuss modelling the problem using the Planning Domain Definition Language (PDDL). We find that a model in which planning actions correspond to player actions is inefficient with a grounding-based state-of-the-art planner. However, with a more fine-grained action model, where each change of a block is a planning action, solving performance is dramatically improved. We also describe two lifted constraint models, able to capture the inherent complexities of Plotting and enabling the application of efficient solving approaches from SAT and CP. Our empirical results with these models demonstrates that they can compete with, and often exceed, the performance of the dedicated planning solvers, suggesting that the richer languages available to constraint modelling can be of benefit when considering planning problems with complex changes of state. CP and SAT solvers solved almost all of the largest and most challenging instances within 1 hour, whereas the best planning approach solved approximately 30%. Finally, the flexibility provided by the constraint models allows us to easily curate interesting levels for human players.<\/jats:p>","DOI":"10.1007\/s10601-024-09370-x","type":"journal-article","created":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T08:12:40Z","timestamp":1726215160000},"page":"40-79","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Plotting: a case study in lifted planning with constraints"],"prefix":"10.1007","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9021-3047","authenticated-orcid":false,"given":"Joan","family":"Espasa","sequence":"first","affiliation":[]},{"given":"Ian","family":"Miguel","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Nightingale","sequence":"additional","affiliation":[]},{"given":"Andr\u00e1s Z.","family":"Salamon","sequence":"additional","affiliation":[]},{"given":"Mateu","family":"Villaret","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,13]]},"reference":[{"key":"9370_CR1","doi-asserted-by":"publisher","unstructured":"Ghallab, M., Nau, D., & Traverso, P. (2004). Automated planning: Theory and practice. Elsevier, San Francisco, USA. https:\/\/doi.org\/10.1016\/B978-1-55860-856-6.X5000-5","DOI":"10.1016\/B978-1-55860-856-6.X5000-5"},{"key":"9370_CR2","unstructured":"Long, D. (2019). Drilling down: Planning in the field. Invited talk, Twenty-Ninth International Conference on Automated Planning and Scheduling, (ICAPS), Berkeley, California. https:\/\/www.youtube.com\/watch?v=Zwhnlw118D4"},{"key":"9370_CR3","unstructured":"Niemueller, T., Karpas, E., Vaquero, T., & Timmons, E. (2016). Planning competition for logistics robots in simulation. In Proceedings of the 4th workshop on planning and robotics (PlanRob) at the 26th International Conference on Automated Planning and Scheduling (ICAPS) (pp. 131\u2013134). https:\/\/web.archive.org\/web\/20221008151837\/https:\/\/icaps16.icaps-conference.org\/proceedings\/planrob16.pdf"},{"key":"9370_CR4","doi-asserted-by":"publisher","unstructured":"Masoumi, A., Antoniazzi, M., & Soutchanski, M. (2015). Modeling organic chemistry and planning organic synthesis. In Global Conference on Artificial Intelligence (GCAI) (pp. 176\u2013195). https:\/\/doi.org\/10.29007\/493z","DOI":"10.29007\/493z"},{"issue":"1","key":"9370_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10845-008-0203-4","volume":"21","author":"R Bart\u00e1k","year":"2010","unstructured":"Bart\u00e1k, R., Salido, M. A., & Rossi, F. (2010). Constraint satisfaction techniques in planning and scheduling. Journal of Intelligent Manufacturing, 21(1), 5\u201315. https:\/\/doi.org\/10.1007\/s10845-008-0203-4","journal-title":"Journal of Intelligent Manufacturing"},{"key":"9370_CR6","unstructured":"Bart\u00e1k, R., & Toropila, D. (2008). Reformulating constraint models for classical planning. In D. Wilson, & H. C. Lane (Eds.), Proceedings of the twenty-first international Florida artificial intelligence research society conference (FLAIRS) (pp. 525\u2013530). https:\/\/web.archive.org\/web\/20220202110048\/https:\/\/kti.mff.cuni.cz\/~bartak\/downloads\/FLAIRS2008.pdf"},{"issue":"3","key":"9370_CR7","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.artint.2005.08.004","volume":"170","author":"V Vidal","year":"2006","unstructured":"Vidal, V., & Geffner, H. (2006). Branching and pruning: An optimal temporal POCL planner based on constraint programming. Artificial Intelligence, 170(3), 298\u2013335. https:\/\/doi.org\/10.1016\/j.artint.2005.08.004","journal-title":"Artificial Intelligence"},{"key":"9370_CR8","doi-asserted-by":"publisher","unstructured":"Babaki, B., Pesant, G., & Quimper, C. (2020). Solving classical AI planning problems using planning-independent CP modeling and search. In D. Harabor, & M. Vallati (Eds.), Proceedings of the thirteenth international Symposium on Combinatorial Search (SOCS) (pp. 2\u201310). AAAI Press, Washington, DC. https:\/\/doi.org\/10.1609\/socs.v11i1.18529","DOI":"10.1609\/socs.v11i1.18529"},{"key":"9370_CR9","unstructured":"Arxer, J. E., Miguel, I., & Villaret, M. (2022). CSPLib Problem 088: Plotting. http:\/\/www.csplib.org\/Problems\/prob088"},{"key":"9370_CR10","doi-asserted-by":"publisher","unstructured":"Haslum, P., Lipovetzky, N., Magazzeni, D., & Muise, C. (2019). An introduction to the planning domain definition language. Synthesis Lectures on Artificial Intelligence and Machine Learning. Springer, Cham, Switzerland. https:\/\/doi.org\/10.2200\/S00900ED2V01Y201902AIM042","DOI":"10.2200\/S00900ED2V01Y201902AIM042"},{"key":"9370_CR11","doi-asserted-by":"publisher","unstructured":"Corr\u00eaa, A. B., Pommerening, F., Helmert, M., & Franc\u00e8s, G. (2020). Lifted successor generation using query optimization techniques. In J. C. Beck, O. Buffet, J. Hoffmann, E. Karpas, & S. Sohrabi (Eds.), Proceedings of the thirtieth International Conference on Automated Planning and Scheduling (ICAPS) (pp. 80\u201389). AAAI Press, San Francisco. https:\/\/doi.org\/10.1609\/icaps.v30i1.6648","DOI":"10.1609\/icaps.v30i1.6648"},{"key":"9370_CR12","unstructured":"Ridder, B. (2014). Lifted heuristics: Towards more scalable planning systems. PhD thesis, King\u2019s College London. https:\/\/kclpure.kcl.ac.uk\/portal\/files\/13561312\/Studentthesis-Bernardus_Ridder_2014.pdf"},{"key":"9370_CR13","unstructured":"Espasa, J., Miguel, I., Coll, J., & Villaret, M. (2019). Towards lifted encodings for numeric planning in essence prime. Proceedings of the 18th international workshop on constraint modelling and reformulation (ModRef). https:\/\/modref.github.io\/papers\/ModRef2019_Towards%20Lifted%20Encodings%20for%20Numeric%20Planning%20in%20Essence%20Prime.pdf"},{"key":"9370_CR14","unstructured":"van Beek, P., & Chen, X. (1999). CPlan: A constraint programming approach to planning. In Proceedings of the sixteenth national conference on AI and eleventh conference on innovative applications of AI (AAAI) (pp. 585\u2013590). https:\/\/web.archive.org\/web\/20221125213531\/https:\/\/www.aaai.org\/Library\/AAAI\/1999\/aaai99-083.php"},{"key":"9370_CR15","unstructured":"Nightingale, P., & Rendl, A. (2016). Essence\u2019 Description. arXiv. https:\/\/arxiv.org\/abs\/1601.02865"},{"key":"9370_CR16","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.artint.2017.07.001","volume":"251","author":"P Nightingale","year":"2017","unstructured":"Nightingale, P., Akg\u00fcn, \u00d6., Gent, I. P., Jefferson, C., Miguel, I., & Spracklen, P. (2017). Automatically improving constraint models in Savile Row. Artificial Intelligence, 251, 35\u201361. https:\/\/doi.org\/10.1016\/j.artint.2017.07.001","journal-title":"Artificial Intelligence"},{"key":"9370_CR17","unstructured":"Accenture: The global gaming industry value now exceeds \\$300 billion, new accenture report finds (2021). https:\/\/web.archive.org\/web\/20230207025112\/https:\/\/newsroom.accenture.com\/news\/global-gaming-industry-value-now-exceeds-300-billion-new-accenture-report-finds.htm. Accessed 2 Feb 2022."},{"key":"9370_CR18","doi-asserted-by":"publisher","unstructured":"Glorian, G., Debesson, A., Yvon-Paliot, S., & Simon, L. (2021). The dungeon variations problem using constraint programming. In L. D. Michel (Ed.), Proceedings of the 27th international conference on principles and practice of Constraint Programming (CP). LIPIcs (vol. 210, pp. 27\u201312716). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany. https:\/\/doi.org\/10.4230\/LIPIcs.CP.2021.27","DOI":"10.4230\/LIPIcs.CP.2021.27"},{"key":"9370_CR19","doi-asserted-by":"publisher","unstructured":"Jefferson, C., Moncur, W., & Petrie, K. E. (2011). Combination: Automated generation of puzzles with constraints. In Proceedings of the 2011 ACM Symposium on Applied Computing (SAC) (pp. 907\u2013912). https:\/\/doi.org\/10.1145\/1982185.1982383","DOI":"10.1145\/1982185.1982383"},{"key":"9370_CR20","unstructured":"Espasa, J., Gent, I. P., Hoffmann, R., Jefferson, C., McIlree, M. J., & Lynch, A. M. (2021). Towards generic explanations for pen and paper puzzles with MUSes. In Proceedings of the SICSA eXplainable artifical intelligence workshop. https:\/\/ceur-ws.org\/Vol-2894\/short8.pdf"},{"key":"9370_CR21","unstructured":"Gent, I. P., Jefferson, C., Kelsey, T., Lynce, I., Miguel, I., Nightingale, P., Smith, B. M., & Tarim, S. A. (2007). Search in the patience game \u2018black hole\u2019. AI Communications, 20(3), 211\u2013226. https:\/\/content.iospress.com\/articles\/ai-communications\/aic405"},{"issue":"10","key":"9370_CR22","doi-asserted-by":"publisher","first-page":"2935","DOI":"10.1016\/j.cor.2005.01.018","volume":"33","author":"C Jefferson","year":"2006","unstructured":"Jefferson, C., Miguel, A., Miguel, I., & Tarim, A. (2006). Modelling and solving English Peg Solitaire. Computers and Pperations Research, 33(10), 2935\u20132959. https:\/\/doi.org\/10.1016\/j.cor.2005.01.018","journal-title":"Computers and Pperations Research"},{"key":"9370_CR23","doi-asserted-by":"publisher","unstructured":"Akg\u00fcn, \u00d6., Gent, I. P., Jefferson, C., Miguel, I., Nightingale, P., & Salamon, A. Z. (2018). Automatic discovery and exploitation of promising subproblems for tabulation. In Proceedings of the 24th international conference on principles and practice of Constraint Programming (CP). LNCS (vol. 11008, pp. 3\u201312). Springer, Cham, Switzerland. https:\/\/doi.org\/10.1007\/978-3-319-98334-9_1","DOI":"10.1007\/978-3-319-98334-9_1"},{"key":"9370_CR24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139583923","author":"M Ghallab","year":"2016","unstructured":"Ghallab, M., Nau, D., & Traverso, P. (2016). Automated Planning and Acting. Cambridge University Press, Cambridge.[SPACE]https:\/\/doi.org\/10.1017\/CBO9781139583923","journal-title":"Cambridge University Press, Cambridge."},{"key":"9370_CR25","unstructured":"Kautz, H. A., & Selman, B. (1992). Planning as Satisfiability. In Proceedings of the 10th European Conference on Artificial Intelligence (ECAI) (pp. 359\u2013363). https:\/\/web.archive.org\/web\/20230209175344\/https:\/\/henrykautz.com\/papers\/satplan.pdf"},{"key":"9370_CR26","unstructured":"Kautz, H. A., McAllester, D. A., & Selman, B. (1996). Encoding plans in propositional logic. In Proceedings of the fifth international conference on principles of knowledge representation and reasoning (KR), Cambridge, Massachusetts (pp. 374\u2013384). Morgan Kaufmann, San Francisco. https:\/\/web.archive.org\/web\/20230213123050\/https:\/\/henrykautz.com\/papers\/plankr96.pdf"},{"key":"9370_CR27","doi-asserted-by":"publisher","unstructured":"Rintanen, J. (2012). Engineering efficient planners with SAT. In L. D. Raedt, C. Bessiere, D. Dubois, P. Doherty, P. Frasconi, F. Heintz, & P. J. F. Lucas (Eds.), Proceedings of the 20th European Conference on Artificial Intelligence (ECAI). Frontiers in Artificial Intelligence and Applications (vol. 242, pp. 684\u2013689). IOS Press, Amsterdam. https:\/\/doi.org\/10.3233\/978-1-61499-098-7-684","DOI":"10.3233\/978-1-61499-098-7-684"},{"issue":"12\u201313","key":"9370_CR28","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1016\/j.artint.2006.08.002","volume":"170","author":"J Rintanen","year":"2006","unstructured":"Rintanen, J., Heljanko, K., & Niemel\u00e4, I. (2006). Planning as satisfiability: Parallel plans and algorithms for plan search. Artificial Intelligence, 170(12\u201313), 1031\u20131080. https:\/\/doi.org\/10.1016\/j.artint.2006.08.002","journal-title":"Artificial Intelligence"},{"issue":"5","key":"9370_CR29","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1017\/S0269888916000229","volume":"31","author":"M Bofill","year":"2016","unstructured":"Bofill, M., Espasa, J., & Villaret, M. (2016). The RANTANPLAN planner: System description. Knowledge Engineering Review, 31(5), 452\u2013464. https:\/\/doi.org\/10.1017\/S0269888916000229","journal-title":"Knowledge Engineering Review"},{"key":"9370_CR30","doi-asserted-by":"publisher","unstructured":"Leofante, F., Giunchiglia, E., \u00c1brah\u00e1m, E., & Tacchella, A. (2020). Optimal planning modulo theories. In Proceedings of the twenty-ninth International Joint Conference on Artificial Intelligence (IJCAI) (pp. 4128\u20134134). https:\/\/doi.org\/10.24963\/ijcai.2020\/571","DOI":"10.24963\/ijcai.2020\/571"},{"key":"9370_CR31","unstructured":"Miguel, I., Jarvis, P., & Shen, Q. (2000). Flexible Graphplan. In W. Horn (Ed.), Proceedings of the 14th European Conference on Artificial Intelligence (ECAI) (pp. 506\u2013510). IOS Press, Amsterdam. https:\/\/www.frontiersinai.com\/ecai\/ecai2000\/pdf\/p0506.pdf"},{"key":"9370_CR32","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1613\/jair.5378","volume":"58","author":"NG Ghooshchi","year":"2017","unstructured":"Ghooshchi, N. G., Namazi, M., Newton, M. A. H., & Sattar, A. (2017). Encoding domain transitions for constraint-based planning. Journal of Artificial Intelligence Research, 58, 905\u2013966. https:\/\/doi.org\/10.1613\/jair.5378","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9370_CR33","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1613\/jair.1129","volume":"20","author":"M Fox","year":"2003","unstructured":"Fox, M., & Long, D. (2003). PDDL2.1: An extension to PDDL for expressing temporal planning domains. Journal of Artificial Intelligence Research, 20, 61\u2013124. https:\/\/doi.org\/10.1613\/jair.1129","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9370_CR34","doi-asserted-by":"publisher","unstructured":"Geffner, H. (2000). Functional STRIPS: A more flexible language for planning and problem solving. In Logic-based artificial intelligence (pp. 187\u2013209). Springer, Boston, MA. https:\/\/doi.org\/10.1007\/978-1-4615-1567-8_9","DOI":"10.1007\/978-1-4615-1567-8_9"},{"key":"9370_CR35","doi-asserted-by":"publisher","unstructured":"Gregory, P., Long, D., Fox, M., & Beck, J. C. (2012). Planning modulo theories: Extending the planning paradigm. In Proceedings of the twenty-second International Conference on Automated Planning and Scheduling, ICAPS. AAAI Press, Washington, DC. https:\/\/doi.org\/10.1609\/icaps.v22i1.13505","DOI":"10.1609\/icaps.v22i1.13505"},{"key":"9370_CR36","unstructured":"Franc\u00e8s, G., & Geffner, H. (2016). Effective planning with more expressive languages. In Proceedings of the twenty-fifth International Joint Conference on Artificial Intelligence, IJCAI (pp. 4155\u20134159). https:\/\/www.ijcai.org\/Abstract\/16\/621"},{"issue":"1\u20132","key":"9370_CR37","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/J.ARTINT.2005.05.004","volume":"168","author":"S Thi\u00e9baux","year":"2005","unstructured":"Thi\u00e9baux, S., Hoffmann, J., & Nebel, B. (2005). In defense of PDDL axioms. Artificial Intelligence, 168(1\u20132), 38\u201369. https:\/\/doi.org\/10.1016\/J.ARTINT.2005.05.004","journal-title":"Artificial Intelligence"},{"key":"9370_CR38","unstructured":"Rendl, A., Miguel, I., Gent, I. P., & Gregory, P. (2009). Common subexpressions in constraint models of planning problems. In Proceedings of the eighth Symposium on Abstraction, Reformulation, and Approximation (SARA) (pp. 128\u2013135). AAAI Press, San Francisco. https:\/\/web.archive.org\/web\/20210802163656\/https:\/\/www.aaai.org\/ocs\/index.php\/SARA\/SARA09\/paper\/view\/823\/1163"},{"issue":"1\u20132","key":"9370_CR39","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0004-3702(96)00047-1","volume":"90","author":"A Blum","year":"1997","unstructured":"Blum, A., & Furst, M. L. (1997). Fast planning through planning graph analysis. Artificial Intelligence, 90(1\u20132), 281\u2013300. https:\/\/doi.org\/10.1016\/S0004-3702(96)00047-1","journal-title":"Artificial Intelligence"},{"key":"9370_CR40","unstructured":"Gent, I. P., Jefferson, C., & Miguel, I. (2006). Minion: A fast scalable constraint solver. In G. Brewka, S. Coradeschi, A. Perini, & P. Traverso (Eds.), Proceedings of the 17th European Conference on Artificial Intelligence (ECAI). Frontiers in Artificial Intelligence and Applications (vol. 141, pp. 98\u2013102). IOS Press, Amsterdam. https:\/\/ebooks.iospress.nl\/volumearticle\/2658"},{"key":"9370_CR41","unstructured":"Biere, A., Fazekas, K., Fleury, M., & Heisinger, M. (2020). CaDiCaL, Kissat, Paracooba, Plingeling and Treengeling entering the SAT Competition 2020. In T. Balyo, N. Froleyks, M. Heule, M. Iser, M. J\u00e4rvisalo, & M. Suda (Eds.), Proceedings of SAT Competition 2020 \u2013 Solver and Benchmark Descriptions. Department of Computer Science Report Series B (vol. B-2020-1, pp. 50\u201353). University of Helsinki. http:\/\/hdl.handle.net\/10138\/318754"},{"key":"9370_CR42","unstructured":"Chu, G., Stuckey, P. J., Schutt, A., Ehlers, T., Gange, G., & Francis, K. (2019). Chuffed, a lazy clause generation solver (version 0.10.4). https:\/\/github.com\/chuffed\/chuffed"},{"key":"9370_CR43","unstructured":"Perron, L., & Furnon, V. (2024). OR-Tools (version 9.7.2996). https:\/\/developers.google.com\/optimization\/"},{"key":"9370_CR44","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1613\/jair.1705","volume":"26","author":"M Helmert","year":"2006","unstructured":"Helmert, M. (2006). The fast downward planning system. Journal of Artificial Intelligence and Research, 26, 191\u2013246. https:\/\/doi.org\/10.1613\/jair.1705","journal-title":"Journal of Artificial Intelligence and Research"},{"key":"9370_CR45","doi-asserted-by":"crossref","unstructured":"Speck, D., Gei\u00dfer, F., Mattm\u00fcller, R., & Torralba, \u00c1. (2019). Symbolic planning with axioms. In J. Benton, N. Lipovetzky, E. Onaindia, D. E. Smith, & S. Srivastava (Eds.), Proceedings of the twenty-ninth International Conference on Automated Planning and Scheduling, ICAPS (pp. 464\u2013472).","DOI":"10.1609\/icaps.v29i1.3511"},{"issue":"1\u20132","key":"9370_CR46","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0004-3702(01)00108-4","volume":"129","author":"B Bonet","year":"2001","unstructured":"Bonet, B., & Geffner, H. (2001). Planning as heuristic search. Artificial Intelligence, 129(1\u20132), 5\u201333. https:\/\/doi.org\/10.1016\/S0004-3702(01)00108-4","journal-title":"Artificial Intelligence"},{"issue":"5\u20136","key":"9370_CR47","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/j.artint.2008.10.013","volume":"173","author":"M Helmert","year":"2009","unstructured":"Helmert, M. (2009). Concise finite-domain representations for PDDL planning tasks. Artificial Intelligence, 173(5\u20136), 503\u2013535. https:\/\/doi.org\/10.1016\/j.artint.2008.10.013","journal-title":"Artificial Intelligence"},{"key":"9370_CR48","doi-asserted-by":"publisher","unstructured":"H\u00f6ller, D., Behnke, G., Bercher, P., Biundo, S., Fiorino, H., Pellier, D., & Alford, R. (2020). HDDL: An extension to PDDL for expressing hierarchical planning problems. In Proceedings of AAAI (pp. 9883\u20139891). https:\/\/doi.org\/10.1609\/AAAI.V34I06.6542","DOI":"10.1609\/AAAI.V34I06.6542"},{"key":"9370_CR49","doi-asserted-by":"publisher","unstructured":"Espasa, J., Miguel, I. J., & Villaret, M. (2022). Plotting: A planning problem with complex transitions. In Proceedings of the 28th international conference on principles and practice of Constraint Programming (CP). LIPIcs (vol. 235, pp. 22\u201312217). Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany. https:\/\/doi.org\/10.4230\/LIPIcs.CP.2022.22","DOI":"10.4230\/LIPIcs.CP.2022.22"},{"key":"9370_CR50","unstructured":"Prestwich, S., & Beck, J. C. (2004). Exploiting dominance in three symmetric problems. In Fourth international workshop on symmetry and constraint satisfaction problems (pp. 63\u201370). https:\/\/web.archive.org\/web\/20220121052208\/https:\/\/tidel.mie.utoronto.ca\/pubs\/pseudo.pdf"},{"key":"9370_CR51","doi-asserted-by":"publisher","unstructured":"Frisch, A. M., & Stuckey, P. J. (2009). The proper treatment of undefinedness in constraint languages. In Principles and practice of Constraint Programming-CP 2009: 15th International Conference, CP 2009 Lisbon, Portugal, September 20-24, 2009 (pp. 367\u2013382). Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-642-04244-7_30","DOI":"10.1007\/978-3-642-04244-7_30"},{"issue":"16\u201317","key":"9370_CR52","doi-asserted-by":"publisher","first-page":"1407","DOI":"10.1016\/j.artint.2010.07.001","volume":"174","author":"C Jefferson","year":"2010","unstructured":"Jefferson, C., Moore, N. C., Nightingale, P., & Petrie, K. E. (2010). Implementing logical connectives in constraint programming. Artificial Intelligence, 174(16\u201317), 1407\u20131429. https:\/\/doi.org\/10.1016\/j.artint.2010.07.001","journal-title":"Artificial Intelligence"},{"key":"9370_CR53","doi-asserted-by":"publisher","unstructured":"Feydy, T., Somogyi, Z., & Stuckey, P. J. (2011). Half reification and flattening. In Proceedings of the 17th international conference on principles and practice of Constraint Programming (CP). LNCS (vol. 6876, pp. 286\u2013301). Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-642-23786-7_23","DOI":"10.1007\/978-3-642-23786-7_23"},{"key":"9370_CR54","unstructured":"Gent, I. P. (2002) Arc consistency in SAT. In F. Harmelen (Ed.), Proceedings of the 15th European Conference on Artificial Intelligence (ECAI) (pp. 121\u2013125). IOS Press, Amsterdam. https:\/\/frontiersinai.com\/ecai\/ecai2002\/p0121.html"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-024-09370-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10601-024-09370-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-024-09370-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,4]],"date-time":"2024-11-04T11:10:09Z","timestamp":1730718609000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10601-024-09370-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6]]},"references-count":54,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["9370"],"URL":"https:\/\/doi.org\/10.1007\/s10601-024-09370-x","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"type":"print","value":"1383-7133"},{"type":"electronic","value":"1572-9354"}],"subject":[],"published":{"date-parts":[[2024,6]]},"assertion":[{"value":"27 July 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"A preliminary version of this study appeared in the proceedings of CP 2022\u00a0[].","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Statements and declarations"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}