{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:49:52Z","timestamp":1761806992882,"version":"3.41.2"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1023\/a:1025846120461","type":"journal-article","created":{"date-parts":[[2003,10,24]],"date-time":"2003-10-24T15:29:37Z","timestamp":1067009377000},"page":"389-413","source":"Crossref","is-referenced-by-count":12,"title":["Planning as Propositional CSP: From Walksat to Local Search Techniques for Action Graphs"],"prefix":"10.1007","volume":"8","author":[{"given":"Alfonso","family":"Gerevini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Serina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5141765_CR1","unstructured":"Aarts, E., & Lenstra, J. (1997). Local Search in Combinatorial Optimization. John Wiley and Sons, New York."},{"key":"5141765_CR2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1613\/jair.754","volume":"15","author":"J. Ambite","year":"2001","unstructured":"Ambite, J., & Knoblock, C. (2001). Planning by rewriting. Journal of Artificial Intelligence Research (JAIR), 15: 207\u2013261.","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"5141765_CR3","unstructured":"Anderson, C., Smith, D., & Weld, D. (1998). Conditional effects in graphplan. In Proceedings of the 4th International Conference on Artificial Intelligence Planning Systems (AIPS-98), pages 44\u201353."},{"key":"5141765_CR4","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0004-3702(96)00047-1","volume":"90","author":"A. Blum","year":"1997","unstructured":"Blum, A., & Furst, M. (1997). Fast planning through planning graph analysis. Artificial Intelligence, 90: 281\u2013300.","journal-title":"Artificial Intelligence"},{"key":"5141765_CR5","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0004-3702(01)00082-0","volume":"130","author":"M. Cayrol","year":"2001","unstructured":"Cayrol, M., R\u00e9gnier, P., & Vidal, V. (2001). Least commitment in Graphplan. Artificial Intelligence, 130: 85\u2013118.","journal-title":"Artificial Intelligence"},{"key":"5141765_CR6","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/3-540-45612-0_5","volume":"2148","author":"S. Chien","year":"2001","unstructured":"Chien, S., Knight, R., & Rabideau, G. (2001). An empirical evaluation of the effectiveness of local search for replanning. Lecture Notes in Computer Science, 2148: 79\u201394.","journal-title":"Lecture Notes in Computer Science"},{"key":"5141765_CR7","unstructured":"Dimopoulos, Y. (2002). Improved integer programming models and heuristic search for AI planning. In Proceedings of the Sixth European Conference on Planning (ECP-01). Springer Verlag."},{"key":"5141765_CR8","doi-asserted-by":"crossref","unstructured":"Dimopoulos, Y., & Gerevini, A. (2002). Temporal planning through mixed integer programming: a preliminary report. In Proceedings of the Eighth International Conference on Principles and Practice of Constraint Programming (CP-02).","DOI":"10.1007\/3-540-46135-3_4"},{"issue":"2","key":"5141765_CR9","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0004-3702(01)00128-X","volume":"132","author":"M. Do","year":"2001","unstructured":"Do, M., & Kambhampati, S. (2001). Planning as constraint satisfaction: solving the planning graph by compiling it into CSP. Artificial Intelligence, 132(2): 151\u2013182.","journal-title":"Artificial Intelligence"},{"key":"5141765_CR10","first-page":"87","volume":"10","author":"M. Fox","year":"1998","unstructured":"Fox, M., & Long, D. (1998). Efficient implementation of the plan graph in STAN. Journal of Artificial Intelligence Research (JAIR), 10: 87\u2013115.","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"5141765_CR11","unstructured":"Fox, M., & Long, D. (1999). The detection and exploitation of symmetry in planning problems. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), pages 956\u2013961."},{"key":"5141765_CR12","unstructured":"Gerevini, A., & Serina, I. (1999). Fast planning through greedy action graphs. In Proceedings of the 16th National Conference of the American Association for Artificial Intelligence (AAAI-99), pages 503\u2013510. AAAI Press \/ MIT Press."},{"key":"5141765_CR13","unstructured":"Gerevini, A., & Serina, I. (2000). Fast plan adaptation through planning graphs: local and systematic search techniques. In Proceedings of the 5th International Conference on Artificial Intelligence Planning and Scheduling (AIPS-00), pages 112\u2013121. AAAI Press \/ MIT Press."},{"key":"5141765_CR14","doi-asserted-by":"crossref","unstructured":"Gerevini, A., & Serina, I. (2001). Lagrange multipliers for local search on planning graphs. In Proceedings of the ECAI-2000 Workshop on Local Search for Planning and Scheduling, pages 37\u201354. Springer-Verlag 2148.","DOI":"10.1007\/3-540-45612-0_3"},{"key":"5141765_CR15","unstructured":"Gerevini, A., & Serina, I. (2002). LPG: a planner based on local search for planning graphs with action costs. In Proceedings of the 6th International Conference on Artificial Intelligence Planning and Scheduling (AIPS-02), pages 281\u2013290. AAAI Press \/ MIT Press."},{"key":"5141765_CR16","unstructured":"Giunchiglia, E., Massarotto, A., & Sebastiani, R. (1998). Act, and the rest will follow: exploiting determinism in planning as satisfiability. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98), pages 948\u2013953. AAAI Press."},{"key":"5141765_CR17","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/3-540-45612-0_2","volume":"2148","author":"J. Hamiez","year":"2001","unstructured":"Hamiez, J., & Hao, J. (2001). Solving the sports league scheduling problem with tabu search. Lecture Notes in Computer Science, 2148: 24\u201336.","journal-title":"Lecture Notes in Computer Science"},{"key":"5141765_CR18","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1613\/jair.855","volume":"14","author":"J. Hoffmann","year":"2001","unstructured":"Hoffmann, J., & Nebel, B. (2001). The FF planning system: fast plan generation through heuristic search. Journal of Artificial Intelligence Research (JAIR), 14: 253\u2013302.","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"5141765_CR19","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1023\/A:1006350622830","volume":"24","author":"H. H. Hoos","year":"2000","unstructured":"Hoos, H. H., & St\u00fctzle. (2000). Local search algorithms for SAT: an empirical evaluation. Journal of Automated Reasoning (JAR), 24: 421\u2013481.","journal-title":"Journal of Automated Reasoning (JAR)"},{"key":"5141765_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.655","volume":"12","author":"S. Kambhampati","year":"2000","unstructured":"Kambhampati, S. (2000). Planning graph as (dynamic) CSP: exploiting EBL, DDB and other CSP techniques in graphplan. Journal of Artificial Intelligence Research (JAIR), 12: 1\u201334.","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"5141765_CR21","unstructured":"Kautz, H., McAllester, D., & Selman, B. (1996). Encoding plans in propositional logic. In Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR'96), pages 374\u2013384. Boston, MA."},{"key":"5141765_CR22","unstructured":"Kautz, H., & Selman, B. (1996). Pushing the envelope: planning, propositional logic, and stochastic search. In Shrobe, H., & Senator, T., eds., Proceedings of the Thirteenth National Conference of the American Association for Artificial Intelligence (AAAI-96), pages 1194\u20131201. AAAI Press."},{"key":"5141765_CR23","unstructured":"Kautz, H., & Selman, B. (1999). Unifying SAT-based and graph-based planning. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), pages 318\u2013325."},{"key":"5141765_CR24","doi-asserted-by":"crossref","unstructured":"Koehler, J., Nebel, B., Hoffmann, J., & Dimopoulos, Y. (1997). Extending planning graphs to an ADL subset. In Fourth European Conference on Planning (ECP'97), pages 273\u2013285. Springer Verlag.","DOI":"10.1007\/3-540-63912-8_92"},{"key":"5141765_CR25","unstructured":"Li, C. M., & Anbulagan. (1997). Heuristics based on unit propagation for satisfiability problems. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI-97), pages 366\u2013371."},{"key":"5141765_CR26","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","volume":"58","author":"S. Minton","year":"1992","unstructured":"Minton, S., Johonson, M., Philips, A., & Laird, P. (1992). Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58: 161\u2013205.","journal-title":"Artificial Intelligence"},{"key":"5141765_CR27","unstructured":"Mittal, S., & Falkenhainer, B. (1990). Dynamic constraint satisfaction problems. In Proceedings of the Eighth National Conference on Artificial Intelligence (AAAI-90), pages 25\u201332. Boston, MA."},{"key":"5141765_CR28","doi-asserted-by":"crossref","unstructured":"Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., & Malik, S. (2001). Chaff: engineering an efficient sat solver. In 39th Design Automation Conference, pages 530\u2013535.","DOI":"10.1145\/378239.379017"},{"key":"5141765_CR29","doi-asserted-by":"crossref","unstructured":"Nareyek, A. (2001a). Beyond the plan-length criterion. In Lecture Notes in Computer Science 2148, pages 55\u201378. Springer-Verlag.","DOI":"10.1007\/3-540-45612-0_4"},{"key":"5141765_CR30","doi-asserted-by":"crossref","unstructured":"Nareyek, A. (2001b). Constraint-Based Agents \u2014 An Architecture for Constraint-Based Modeling and Local-Search-Based Reasoning for Planning and Scheduling in Open and Dynamic Worlds. Lecture Notes in Computer Science 2062. Springer-Verlag.","DOI":"10.1007\/3-540-45746-1"},{"issue":"1-2","key":"5141765_CR31","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0004-3702(01)00158-8","volume":"135","author":"X. Nguyen","year":"2002","unstructured":"Nguyen, X., Kambhampati, S., & Nigenda, R. (2002). Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search. Artificial Intelligence, 135(1-2): 73\u2013123.","journal-title":"Artificial Intelligence"},{"key":"5141765_CR32","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C. H. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C. H., & Steiglitz, K. (1982). Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, NJ."},{"key":"5141765_CR33","unstructured":"P\u00e9rez, M. A. (1996). Representing and learning quality-improving search control knowledge. In In Proceedings of the Thirteenth International Conference on Machine Learning, pages 382\u2013390."},{"key":"5141765_CR34","first-page":"337","volume-title":"Proceedings of the Twelfth National Conference of the American Association for Artificial Intelligence (AAAI-94)","author":"B. Selman","year":"1994","unstructured":"Selman, B., Kautz, H., & Cohen, B. (1994). Noise strategies for improving local search. In Proceedings of the Twelfth National Conference of the American Association for Artificial Intelligence (AAAI-94), pages 337\u2013343. Seattle, WA: Morgan Kaufmann."},{"issue":"1","key":"5141765_CR35","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1023\/A:1008287028851","volume":"12","author":"Y. Shang","year":"1998","unstructured":"Shang, Y., & Wah, B. (1998). A discrete lagrangian-based global-search method for solving satisfiability problems. Journal of Global Optimization, 12(1): 61\u201399.","journal-title":"Journal of Global Optimization"},{"key":"5141765_CR36","unstructured":"Smith, D., & Weld, D. (1999). Temporal planning with mutual exclusion reasoning. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), pages 326\u2013337."},{"key":"5141765_CR37","unstructured":"Tara, A. E., & Raymond, J. M. (1997). Learning to improve both efficiency and quality of planning. In Pollack, M., ed., Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97), pages 1227\u20131232. Morgan Kaufmann."},{"issue":"3","key":"5141765_CR38","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1287\/ijoc.8.3.302","volume":"8","author":"R. Vaessens","year":"1996","unstructured":"Vaessens, R., Aarts, E., & Lenstra, J. K. (1996). Job shop scheduling by local search. Journal on Computing Informs, 8(3): 302\u2013317.","journal-title":"Journal on Computing Informs"},{"key":"5141765_CR39","unstructured":"van Beek, P., & Chen, X. (1999). CPlan: a constraint programming approach to planning. In Proceedings of the 16th National Conference of the American Association for Artificial Intelligence (AAAI-99), pages 585\u2013590."},{"key":"5141765_CR40","doi-asserted-by":"crossref","unstructured":"Wah, B. W., & Wu, Z. (1999). The theory of discrete lagrange multipliers for non-linear discrete optimization. In Proc. of Principles and Practice of Constraint Programming (CP-99), pages 28\u201342. Springer-Verlag.","DOI":"10.1007\/978-3-540-48085-3_3"},{"issue":"2","key":"5141765_CR41","first-page":"93","volume":"20","author":"D. Weld","year":"1999","unstructured":"Weld, D. (1999). Recent advances in AI planning. AI Magazine, 20(2): 93\u2013123.","journal-title":"AI Magazine"},{"key":"5141765_CR42","unstructured":"Wolfman, S., & Weld, D. (1999). The LPSAT engine its application to resource planning. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), pages 310\u2013317."},{"key":"5141765_CR43","unstructured":"Wu, Z., & Wah, B. (2000). An efficient global-search strategy in discrete lagrangian methods for solving hard satisfiability problems. In Proceedings of the 17th National Conference of the American Association for Artificial Intelligence (AAAI-00), pages 310\u2013315. AAAI Press \/ MIT Press."},{"key":"5141765_CR44","unstructured":"Zweben, M. S., Daun, B., & Deale, M. (1994). Scheduling and rescheduling with iterative repair. In Zweben, and Fox, eds., Intelligent Scheduling, pages 241\u2013255. Morgan Kaufmann."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1025846120461.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1025846120461\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1025846120461.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:39:02Z","timestamp":1752377942000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1025846120461"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":44,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["5141765"],"URL":"https:\/\/doi.org\/10.1023\/a:1025846120461","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"type":"print","value":"1383-7133"},{"type":"electronic","value":"1572-9354"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}