{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:20:36Z","timestamp":1750306836241,"version":"3.41.0"},"reference-count":82,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2013,12,1]],"date-time":"2013-12-01T00:00:00Z","timestamp":1385856000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["DBI-0743797, IIS-0713109, CNS 1017701"],"award-info":[{"award-number":["DBI-0743797, IIS-0713109, CNS 1017701"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["DBI-0743797, IIS-0713109, CNS 1017701"],"award-info":[{"award-number":["DBI-0743797, IIS-0713109, CNS 1017701"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006112","name":"Microsoft Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006112","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000153","name":"Division of Biological Infrastructure","doi-asserted-by":"publisher","award":["DBI-0743797, IIS-0713109, CNS 1017701"],"award-info":[{"award-number":["DBI-0743797, IIS-0713109, CNS 1017701"]}],"id":[{"id":"10.13039\/100000153","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Intell. Syst. Technol."],"published-print":{"date-parts":[[2013,12]]},"abstract":"<jats:p>Complex features, such as temporal dependencies and numerical cost constraints, are hallmarks of real-world planning problems. In this article, we consider the challenging problem of cost-sensitive temporally expressive (CSTE) planning, which requires concurrency of durative actions and optimization of action costs. We first propose a scheme to translate a CSTE planning problem to a minimum cost (MinCost) satisfiability (SAT) problem and to integrate with a relaxed parallel planning semantics for handling true temporal expressiveness. Our scheme finds solution plans that optimize temporal makespan, and also minimize total action costs at the optimal makespan. We propose two approaches for solving MinCost SAT. The first is based on a transformation of a MinCost SAT problem to a weighted partial Max-SAT (WPMax-SAT), and the second, called BB-CDCL, is an integration of the branch-and-bound technique and the conflict driven clause learning (CDCL) method. We also develop a CSTE customized variable branching scheme for BB-CDCL which can significantly improve the search efficiency. Our experiments on the existing CSTE benchmark domains show that our planner compares favorably to the state-of-the-art temporally expressive planners in both efficiency and quality.<\/jats:p>","DOI":"10.1145\/2542182.2542200","type":"journal-article","created":{"date-parts":[[2014,1,2]],"date-time":"2014-01-02T13:09:43Z","timestamp":1388668183000},"page":"1-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A SAT-based approach to cost-sensitive temporally expressive planning"],"prefix":"10.1145","volume":"5","author":[{"given":"Qiang","family":"Lu","sequence":"first","affiliation":[{"name":"University of Science and Technology of China and Washington University in St. Louis"}]},{"given":"Ruoyun","family":"Huang","sequence":"additional","affiliation":[{"name":"Washington University in St. Louis"}]},{"given":"Yixin","family":"Chen","sequence":"additional","affiliation":[{"name":"Washington University in St. Louis, St. Louis, MO"}]},{"given":"You","family":"Xu","sequence":"additional","affiliation":[{"name":"Washington University in St. Louis"}]},{"given":"Weixiong","family":"Zhang","sequence":"additional","affiliation":[{"name":"Washington University in St. Louis"}]},{"given":"Guoliang","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China"}]}],"member":"320","published-online":{"date-parts":[[2014,1,3]]},"reference":[{"volume-title":"Proceedings of the Catalan Conference on Artificial Intelligence.","author":"Alsinet T.","key":"e_1_2_2_1_1","unstructured":"Alsinet , T. , Manya , F. , and Planes , J . 2003. Improved branch and bound algorithms for Max-SAT and weighted Max-SAT . In Proceedings of the Catalan Conference on Artificial Intelligence. Alsinet, T., Manya, F., and Planes, J. 2003. Improved branch and bound algorithms for Max-SAT and weighted Max-SAT. In Proceedings of the Catalan Conference on Artificial Intelligence."},{"volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence. 417--424","author":"Bacchus F.","key":"e_1_2_2_2_1","unstructured":"Bacchus , F. and Ady , M . 2001. Planning with resources and concurrency: A forward chaining approach . In Proceedings of the International Joint Conference on Artificial Intelligence. 417--424 . Bacchus, F. and Ady, M. 2001. Planning with resources and concurrency: A forward chaining approach. In Proceedings of the International Joint Conference on Artificial Intelligence. 417--424."},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SASO.2007.51"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(96)00047-1"},{"volume-title":"Proceedings of the International Conference on Automated Planning and Scheduling. 292--299","author":"B\u00fcttner M.","key":"e_1_2_2_5_1","unstructured":"B\u00fcttner , M. and Rintanen , J . 2005. Satisfiability planning with constraints on the number of actions . In Proceedings of the International Conference on Automated Planning and Scheduling. 292--299 . B\u00fcttner, M. and Rintanen, J. 2005. Satisfiability planning with constraints on the number of actions. In Proceedings of the International Conference on Automated Planning and Scheduling. 292--299."},{"volume-title":"Proceedings of the Workshop on Planning for Web Services, International Conference on Automated Planning and Scheduling.","author":"Carman M.","key":"e_1_2_2_6_1","unstructured":"Carman , M. , Serafini , L. , and Traverso , P . 2003. Web service composition as planning . In Proceedings of the Workshop on Planning for Web Services, International Conference on Automated Planning and Scheduling. Carman, M., Serafini, L., and Traverso, P. 2003. Web service composition as planning. In Proceedings of the Workshop on Planning for Web Services, International Conference on Automated Planning and Scheduling."},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2009.11.007"},{"volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence. 1659--1664","author":"Chen Y.","key":"e_1_2_2_8_1","unstructured":"Chen , Y. and Yao , G . 2009. Completeness and optimality preserving reduction for planning . In Proceedings of the International Joint Conference on Artificial Intelligence. 1659--1664 . Chen, Y. and Yao, G. 2009. Completeness and optimality preserving reduction for planning. In Proceedings of the International Joint Conference on Artificial Intelligence. 1659--1664."},{"volume-title":"Proceedings of the Workshop on International Planning Competition, International Conference on Automated Planning and Scheduling.","author":"Chen Y.","key":"e_1_2_2_9_1","unstructured":"Chen , Y. , Lv , Q. , and Huang , R . 2008. Plan-A: A cost-optimal planner based on SAT-constrained optimization . In Proceedings of the Workshop on International Planning Competition, International Conference on Automated Planning and Scheduling. Chen, Y., Lv, Q., and Huang, R. 2008. Plan-A: A cost-optimal planner based on SAT-constrained optimization. In Proceedings of the Workshop on International Planning Competition, International Conference on Automated Planning and Scheduling."},{"volume-title":"Stratified Planning. In Proceedings of the International Joint Conference on Artificial Intelligence. 1665--1670","author":"Chen Y.","key":"e_1_2_2_10_1","unstructured":"Chen , Y. , Xu , Y. , and Yao , G . 2009 . Stratified Planning. In Proceedings of the International Joint Conference on Artificial Intelligence. 1665--1670 . Chen, Y., Xu, Y., and Yao, G. 2009. Stratified Planning. In Proceedings of the International Joint Conference on Artificial Intelligence. 1665--1670."},{"volume-title":"Proceedings of the International Conference on Automated Planning and Scheduling. 42--49","author":"Coles A. J.","key":"e_1_2_2_11_1","unstructured":"Coles , A. J. , Coles , A. , Fox , M. , and Long , D . 2010. Forward-chaining partial-order planning . In Proceedings of the International Conference on Automated Planning and Scheduling. 42--49 . Coles, A. J., Coles, A., Fox, M., and Long, D. 2010. Forward-chaining partial-order planning. In Proceedings of the International Conference on Automated Planning and Scheduling. 42--49."},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2008.08.003"},{"volume-title":"Proceedings of the National Conference on Artificial Intelligence. 892--897","author":"Coles A.","key":"e_1_2_2_13_1","unstructured":"Coles , A. , Fox , M. , Long , D. , and Smith , A . 2008. Planning with problems requiring temporal coordination . In Proceedings of the National Conference on Artificial Intelligence. 892--897 . Coles, A., Fox, M., Long, D., and Smith, A. 2008. Planning with problems requiring temporal coordination. In Proceedings of the National Conference on Artificial Intelligence. 892--897."},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/240518.240555"},{"volume-title":"Proceedings of the International Conference on Automated Planning and Scheduling.","author":"Cushing W.","key":"e_1_2_2_15_1","unstructured":"Cushing , W. , Kambhampati , S. , and Talamadupula , K . 2007a. Evaluating temporal planning domains . In Proceedings of the International Conference on Automated Planning and Scheduling. Cushing, W., Kambhampati, S., and Talamadupula, K. 2007a. Evaluating temporal planning domains. In Proceedings of the International Conference on Automated Planning and Scheduling."},{"key":"e_1_2_2_16_1","unstructured":"Cushing W. Kambhampati S. Mausam and Weld D. S. 2007b. When is temporal planning really temporal&quest; In Proceedings of the International Joint Conference on Artificial Intelligence. 1852--1859.   Cushing W. Kambhampati S. Mausam and Weld D. S. 2007b. When is temporal planning really temporal&quest; In Proceedings of the International Joint Conference on Artificial Intelligence. 1852--1859."},{"volume-title":"Proceedings of the International Conference on Principles and Practice of Constraint Programming. 225--240","author":"Darras S.","key":"e_1_2_2_17_1","unstructured":"Darras , S. , Dequen , G. , Devendeville , L. , and Li , C . -M. 2007. On inconsistent clause-subsets for Max-SAT solving . In Proceedings of the International Conference on Principles and Practice of Constraint Programming. 225--240 . Darras, S., Dequen, G., Devendeville, L., and Li, C.-M. 2007. On inconsistent clause-subsets for Max-SAT solving. In Proceedings of the International Conference on Principles and Practice of Constraint Programming. 225--240."},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/368273.368557"},{"volume-title":"Proceedings of the European Conference on Planning. 169--181","author":"Dimopoulos Y.","key":"e_1_2_2_19_1","unstructured":"Dimopoulos , Y. , Nebel , B. , and Koehler , J . 1997. Encoding planning problems in nonmonotonic logic programs . In Proceedings of the European Conference on Planning. 169--181 . Dimopoulos, Y., Nebel, B., and Koehler, J. 1997. Encoding planning problems in nonmonotonic logic programs. In Proceedings of the European Conference on Planning. 169--181."},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1156"},{"volume-title":"Proceedings of the International Conference on Automated Planning and Scheduling.","author":"Do M. B.","key":"e_1_2_2_21_1","unstructured":"Do , M. B. , Ruml , W. , and Zhou , R . 2008. Planning for modular printers: Beyond productivity . In Proceedings of the International Conference on Automated Planning and Scheduling. Do, M. B., Ruml, W., and Zhou, R. 2008. Planning for modular printers: Beyond productivity. In Proceedings of the International Conference on Automated Planning and Scheduling."},{"volume-title":"Proceedings of the International Conference on Theory and Applications of Satisfiability Testing. 502--518","author":"E\u00e9n N.","key":"e_1_2_2_22_1","unstructured":"E\u00e9n , N. and S\u00f6rensson , N . 2003. An extensible SAT-solver . In Proceedings of the International Conference on Theory and Applications of Satisfiability Testing. 502--518 . E\u00e9n, N. and S\u00f6rensson, N. 2003. An extensible SAT-solver. In Proceedings of the International Conference on Theory and Applications of Satisfiability Testing. 502--518."},{"volume-title":"Proceedings of the International Conference on Automated Planning and Scheduling. 130--137","author":"Eyerich P.","key":"e_1_2_2_23_1","unstructured":"Eyerich , P. , Mattm\u00fcller , R. , and R\u00f6ger , G . 2009. Using the context-enhanced additive heuristic for temporal and numeric planning . In Proceedings of the International Conference on Automated Planning and Scheduling. 130--137 . Eyerich, P., Mattm\u00fcller, R., and R\u00f6ger, G. 2009. Using the context-enhanced additive heuristic for temporal and numeric planning. In Proceedings of the International Conference on Automated Planning and Scheduling. 130--137."},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1129"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1233501.1233681"},{"volume-title":"Proceedings of the International Conference on AI Planning and Scheduling. 13--22","author":"Gerevini A.","key":"e_1_2_2_26_1","unstructured":"Gerevini , A. and Serina , I . 2002. LPG: A planner based on local search for planning graphs with action costs . In Proceedings of the International Conference on AI Planning and Scheduling. 13--22 . Gerevini, A. and Serina, I. 2002. LPG: A planner based on local search for planning graphs with action costs. In Proceedings of the International Conference on AI Planning and Scheduling. 13--22."},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2008.01.002"},{"volume-title":"Proceedings of the International Conference on Automated Planning and Scheduling.","author":"Gerevini A.","key":"e_1_2_2_28_1","unstructured":"Gerevini , A. , Saetti , A. , and Serina , I . 2010. Temporal planning with problems requiring concurrency through action graphs and local search . In Proceedings of the International Conference on Automated Planning and Scheduling. Gerevini, A., Saetti, A., and Serina, I. 2010. Temporal planning with problems requiring concurrency through action graphs and local search. In Proceedings of the International Conference on Automated Planning and Scheduling."},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/11853886_43"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74782-6_37"},{"key":"e_1_2_2_31_1","volume-title":"Proceedings of the Workshop on International Planning Competition, International Conference on Automated Planning and Scheduling.","author":"Haslum P.","year":"2008","unstructured":"Haslum , P. 2008 . Additive and reversed relaxed reachability heuristics revisited . In Proceedings of the Workshop on International Planning Competition, International Conference on Automated Planning and Scheduling. Haslum, P. 2008. Additive and reversed relaxed reachability heuristics revisited. In Proceedings of the Workshop on International Planning Competition, International Conference on Automated Planning and Scheduling."},{"volume-title":"Proceedings of the International Conference on Automated Planning and Scheduling. 140--149","author":"Haslum P.","key":"e_1_2_2_32_1","unstructured":"Haslum , P. and Geffner , H . 2000. Admissible heuristics for optimal planning . In Proceedings of the International Conference on Automated Planning and Scheduling. 140--149 . Haslum, P. and Geffner, H. 2000. Admissible heuristics for optimal planning. In Proceedings of the International Conference on Automated Planning and Scheduling. 140--149."},{"volume-title":"Proceedings of the Workshop on Planning with Resources, International Joint Conference on Artificial Intelligence.","author":"Haslum P.","key":"e_1_2_2_33_1","unstructured":"Haslum , P. and Geffner , H . 2001. Heuristic planning with time and resources . In Proceedings of the Workshop on Planning with Resources, International Joint Conference on Artificial Intelligence. Haslum, P. and Geffner, H. 2001. Heuristic planning with time and resources. In Proceedings of the Workshop on Planning with Resources, International Joint Conference on Artificial Intelligence."},{"volume-title":"Proceedings of the National Conference on Artificial Intelligence. 1547--1550","author":"Helmert M.","key":"e_1_2_2_34_1","unstructured":"Helmert , M. , Haslum , P. , and Hoffmann , J . 2008. Explicit-state abstraction: A new method for generating heuristic functions . In Proceedings of the National Conference on Artificial Intelligence. 1547--1550 . Helmert, M., Haslum, P., and Hoffmann, J. 2008. Explicit-state abstraction: A new method for generating heuristic functions. In Proceedings of the National Conference on Artificial Intelligence. 1547--1550."},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622394.1622404"},{"key":"e_1_2_2_36_1","volume-title":"Proceedings of the International Conference on Automated Planning and Scheduling. 192--199","author":"Hu Y.","year":"2007","unstructured":"Hu , Y. 2007 . Temporally-expressive planning as constraint satisfaction problems . In Proceedings of the International Conference on Automated Planning and Scheduling. 192--199 . Hu, Y. 2007. Temporally-expressive planning as constraint satisfaction problems. In Proceedings of the International Conference on Automated Planning and Scheduling. 192--199."},{"volume-title":"Proceedings of the International Conference on Automated Planning and Scheduling.","author":"Huang R.","key":"e_1_2_2_37_1","unstructured":"Huang , R. , Chen , Y. , and Zhang , W . 2009. An optimal temporally expressive planner: Initial results and application to P2P network optimization . In Proceedings of the International Conference on Automated Planning and Scheduling. Huang, R., Chen, Y., and Zhang, W. 2009. An optimal temporally expressive planner: Initial results and application to P2P network optimization. In Proceedings of the International Conference on Automated Planning and Scheduling."},{"volume-title":"Proceedings of the National Conference on Artificial Intelligence.","author":"Huang R.","key":"e_1_2_2_38_1","unstructured":"Huang , R. , Chen , Y. , and Zhang , W . 2010. A novel transition based encoding scheme for planning as satisfiability . In Proceedings of the National Conference on Artificial Intelligence. Huang, R., Chen, Y., and Zhang, W. 2010. A novel transition based encoding scheme for planning as satisfiability. In Proceedings of the National Conference on Artificial Intelligence."},{"key":"e_1_2_2_39_1","unstructured":"IPC. 2002. The third international planning competition. http:\/\/planning.cis.strath.ac.uk\/competition\/.  IPC. 2002. The third international planning competition. http:\/\/planning.cis.strath.ac.uk\/competition\/."},{"key":"e_1_2_2_40_1","unstructured":"IPC. 2008. The sixth international planning competition. http:\/\/ipc.informatik.uni-freiburg.de\/.  IPC. 2008. The sixth international planning competition. http:\/\/ipc.informatik.uni-freiburg.de\/."},{"key":"e_1_2_2_41_1","volume-title":"Proceedings of the Workshop on International Planning Competition, International Conference on Automated Planning and Scheduling.","author":"Kautz H.","year":"2004","unstructured":"Kautz , H. 2004 . SATPlan04: Planning as satisfiability . In Proceedings of the Workshop on International Planning Competition, International Conference on Automated Planning and Scheduling. Kautz, H. 2004. SATPlan04: Planning as satisfiability. In Proceedings of the Workshop on International Planning Competition, International Conference on Automated Planning and Scheduling."},{"volume-title":"Proceedings of the European Conference on Artificial Intelligence.","author":"Kautz H.","key":"e_1_2_2_42_1","unstructured":"Kautz , H. and Selman , B . 1992. Planning as satisfiability . In Proceedings of the European Conference on Artificial Intelligence. Kautz, H. and Selman, B. 1992. Planning as satisfiability. In Proceedings of the European Conference on Artificial Intelligence."},{"volume-title":"Proceedings of the National Conference on Artificial Intelligence. 1194--1201","author":"Kautz H.","key":"e_1_2_2_43_1","unstructured":"Kautz , H. and Selman , B . 1996. Pushing the envelope: Planning, propositional logic, and stochastic search . In Proceedings of the National Conference on Artificial Intelligence. 1194--1201 . Kautz, H. and Selman, B. 1996. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proceedings of the National Conference on Artificial Intelligence. 1194--1201."},{"volume-title":"Proceedings of the Workshop on International Planning Competition, International Conference on Automated Planning and Scheduling.","author":"Keyder E.","key":"e_1_2_2_44_1","unstructured":"Keyder , E. and Geffner , H . 2008. The FF(ha) planner for planning with action costs . In Proceedings of the Workshop on International Planning Competition, International Conference on Automated Planning and Scheduling. Keyder, E. and Geffner, H. 2008. The FF(ha) planner for planning with action costs. In Proceedings of the Workshop on International Planning Competition, International Conference on Automated Planning and Scheduling."},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1189"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02777-2_42"},{"volume-title":"Proceedings of the National Conference on Artificial Intelligence. 86--91","author":"Li C. M.","key":"e_1_2_2_47_1","unstructured":"Li , C. M. , Manya , F. , and Planes , J . 2006. Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT . In Proceedings of the National Conference on Artificial Intelligence. 86--91 . Li, C. M., Manya, F., and Planes, J. 2006. Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT. In Proceedings of the National Conference on Artificial Intelligence. 86--91."},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622637.1622646"},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02777-2_43"},{"volume-title":"Proceedings of the International Conference on Automated Planning and Scheduling. 52--61","author":"Long D.","key":"e_1_2_2_51_1","unstructured":"Long , D. and Fox , M . 2003. Exploiting a graphplan framework in temporal planning . In Proceedings of the International Conference on Automated Planning and Scheduling. 52--61 . Long, D. and Fox, M. 2003. Exploiting a graphplan framework in temporal planning. In Proceedings of the International Conference on Automated Planning and Scheduling. 52--61."},{"key":"e_1_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.998623"},{"key":"e_1_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02777-2_45"},{"volume-title":"Proceedings of the International Conference on Computer-Aided Design. 220--227","author":"Marques-Silva J. P.","key":"e_1_2_2_54_1","unstructured":"Marques-Silva , J. P. , Silva , J. P. M. , Sakallah , K. A. , and Sakallah , K. A . 1996. GRASP: A new search algorithm for satisfiability . In Proceedings of the International Conference on Computer-Aided Design. 220--227 . Marques-Silva, J. P., Silva, J. P. M., Sakallah, K. A., and Sakallah, K. A. 1996. GRASP: A new search algorithm for satisfiability. In Proceedings of the International Conference on Computer-Aided Design. 220--227."},{"key":"e_1_2_2_55_1","unstructured":"Max-SAT. 2010. The Sixth Max-SAT Evaluation. http:\/\/www.maxsat.udl.cat\/10\/.  Max-SAT. 2010. The Sixth Max-SAT Evaluation. http:\/\/www.maxsat.udl.cat\/10\/."},{"key":"e_1_2_2_56_1","first-page":"112","article-title":"A SAT solver primer","volume":"85","author":"Mitchell D. G.","year":"2005","unstructured":"Mitchell , D. G. 2005 . A SAT solver primer . Bull. Eur. Assoc. Theor. Computer Sci. 85 , 112 -- 132 . Mitchell, D. G. 2005. A SAT solver primer. Bull. Eur. Assoc. Theor. Computer Sci. 85, 112--132.","journal-title":"Bull. Eur. Assoc. Theor. Computer Sci."},{"key":"e_1_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/378239.379017"},{"volume-title":"Proceedings of the National Conference on Artificial Intelligence. 1010--1015","author":"Penberthy J. S.","key":"e_1_2_2_58_1","unstructured":"Penberthy , J. S. and Weld , D. S . 1994. Temporal planning with continuous change . In Proceedings of the National Conference on Artificial Intelligence. 1010--1015 . Penberthy, J. S. and Weld, D. S. 1994. Temporal planning with continuous change. In Proceedings of the National Conference on Artificial Intelligence. 1010--1015."},{"volume-title":"Proceedings of the Australian Conference on Artificial Intelligence. 223--233","author":"Pipatsrisawat K.","key":"e_1_2_2_59_1","unstructured":"Pipatsrisawat , K. and Darwiche , A . 2007. Clone: solving weighted Max-SAT in a reduced search space . In Proceedings of the Australian Conference on Artificial Intelligence. 223--233 . Pipatsrisawat, K. and Darwiche, A. 2007. Clone: solving weighted Max-SAT in a reduced search space. In Proceedings of the Australian Conference on Artificial Intelligence. 223--233."},{"key":"e_1_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45193-8_115"},{"key":"e_1_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30581-1_5"},{"volume-title":"Proceedings of the Workshop on Planning with Resources, International Joint Conference on Artificial Intelligence.","author":"Refanidis I.","key":"e_1_2_2_62_1","unstructured":"Refanidis , I. , Refanidis , I. , and Vlahavas , I . 2001. A framework for multi-criteria plan evaluation in heuristic state-space planning . In Proceedings of the Workshop on Planning with Resources, International Joint Conference on Artificial Intelligence. Refanidis, I., Refanidis, I., and Vlahavas, I. 2001. A framework for multi-criteria plan evaluation in heuristic state-space planning. In Proceedings of the Workshop on Planning with Resources, International Joint Conference on Artificial Intelligence."},{"volume-title":"Proceedings of the Workshop on International Planning Competition, International Conference on Automated Planning and Scheduling.","author":"Richter S.","key":"e_1_2_2_63_1","unstructured":"Richter , S. and Westphal , M . 2008. The LAMA planner: Using landmark counting in heuristic search . In Proceedings of the Workshop on International Planning Competition, International Conference on Automated Planning and Scheduling. Richter, S. and Westphal, M. 2008. The LAMA planner: Using landmark counting in heuristic search. In Proceedings of the Workshop on International Planning Competition, International Conference on Automated Planning and Scheduling."},{"key":"e_1_2_2_64_1","doi-asserted-by":"crossref","unstructured":"Richter S. and Westphal M. 2010. The LAMA planner: Guiding cost-based anytime planning with landmarks. J. Artif. Intell. Res.   Richter S. and Westphal M. 2010. The LAMA planner: Guiding cost-based anytime planning with landmarks. J. Artif. Intell. Res.","DOI":"10.1613\/jair.2972"},{"key":"e_1_2_2_65_1","volume-title":"Proceedings of the National Conference on Artificial Intelligence.","author":"Rintanen J.","year":"2007","unstructured":"Rintanen , J. 2007 . Complexity of concurrent temporal planning . In Proceedings of the National Conference on Artificial Intelligence. Rintanen, J. 2007. Complexity of concurrent temporal planning. In Proceedings of the National Conference on Artificial Intelligence."},{"key":"e_1_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2006.08.002"},{"volume-title":"Proceedings of the Workshop on International Planning Competition, International Conference on Automated Planning and Scheduling.","author":"Robinson N.","key":"e_1_2_2_67_1","unstructured":"Robinson , N. , Gretton , C. , and Pham , D. N . 2008a. CO-PLAN: Combining SAT-based planning with forward-search . In Proceedings of the Workshop on International Planning Competition, International Conference on Automated Planning and Scheduling. Robinson, N., Gretton, C., and Pham, D. N. 2008a. CO-PLAN: Combining SAT-based planning with forward-search. In Proceedings of the Workshop on International Planning Competition, International Conference on Automated Planning and Scheduling."},{"volume-title":"Proceedings of the International Conference on Automated Planning and Scheduling. 296--303","author":"Robinson N.","key":"e_1_2_2_68_1","unstructured":"Robinson , N. , Gretton , C. , Pham , D. , and Sattar , A . 2008b. A compact and efficient SAT encoding for planning . In Proceedings of the International Conference on Automated Planning and Scheduling. 296--303 . Robinson, N., Gretton, C., Pham, D., and Sattar, A. 2008b. A compact and efficient SAT encoding for planning. In Proceedings of the International Conference on Automated Planning and Scheduling. 296--303."},{"volume-title":"Pacific Rim International Conference on Artificial Intelligence. 231--243","author":"Robinson N.","key":"e_1_2_2_69_1","unstructured":"Robinson , N. , Gretton , C. , Pham , D. N. , and Sattar , A . 2010. Partial weighted MaxSAT for optimal planning . In Pacific Rim International Conference on Artificial Intelligence. 231--243 . Robinson, N., Gretton, C., Pham, D. N., and Sattar, A. 2010. Partial weighted MaxSAT for optimal planning. In Pacific Rim International Conference on Artificial Intelligence. 231--243."},{"key":"e_1_2_2_70_1","unstructured":"SAT4J. 2004. http:\/\/www.sat4j.org\/.  SAT4J. 2004. http:\/\/www.sat4j.org\/."},{"volume-title":"Proceedings of the National Conference on Artificial Intelligence. 531--536","author":"Shin J.","key":"e_1_2_2_71_1","unstructured":"Shin , J. and Davis , E . 2004. Continuous time in a SAT-based planner . In Proceedings of the National Conference on Artificial Intelligence. 531--536 . Shin, J. and Davis, E. 2004. Continuous time in a SAT-based planner. In Proceedings of the National Conference on Artificial Intelligence. 531--536."},{"key":"e_1_2_2_72_1","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence. 326--337","author":"Smith D. E.","year":"1999","unstructured":"Smith , D. E. 1999 . Temporal planning with mutual exclusion reasoning . In Proceedings of the International Joint Conference on Artificial Intelligence. 326--337 . Smith, D. E. 1999. Temporal planning with mutual exclusion reasoning. In Proceedings of the International Joint Conference on Artificial Intelligence. 326--337."},{"key":"e_1_2_2_73_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1997"},{"volume-title":"Proceedings of the Workshop on International Planning Competition, International Conference on Automated Planning and Scheduling. 59--60","author":"Vidal V.","key":"e_1_2_2_74_1","unstructured":"Vidal , V. and Geffner , H . 2004. CPT: An optimal temporal POCL planner based on constraint programming . In Proceedings of the Workshop on International Planning Competition, International Conference on Automated Planning and Scheduling. 59--60 . Vidal, V. and Geffner, H. 2004. CPT: An optimal temporal POCL planner based on constraint programming. In Proceedings of the Workshop on International Planning Competition, International Conference on Automated Planning and Scheduling. 59--60."},{"key":"e_1_2_2_75_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2005.08.004"},{"key":"e_1_2_2_76_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2005.07.001"},{"volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence. 310--316","author":"Wolfman S. A.","key":"e_1_2_2_77_1","unstructured":"Wolfman , S. A. and Weld , D. S . 1999. The LPSAT engine and its application to resource planning . In Proceedings of the International Joint Conference on Artificial Intelligence. 310--316 . Wolfman, S. A. and Weld, D. S. 1999. The LPSAT engine and its application to resource planning. In Proceedings of the International Joint Conference on Artificial Intelligence. 310--316."},{"key":"e_1_2_2_78_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2005.01.004"},{"key":"e_1_2_2_79_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2006.11.005"},{"key":"e_1_2_2_80_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1136"},{"volume-title":"Proceedings of the International Conference on Computer-Aided Design. 279--285","author":"Zhang L.","key":"e_1_2_2_81_1","unstructured":"Zhang , L. , Madigan , C. F. , Moskewicz , M. H. , and Malik , S . 2001. Efficient conflict driven learning in a Boolean satisfiability solver . In Proceedings of the International Conference on Computer-Aided Design. 279--285 . Zhang, L., Madigan, C. F., Moskewicz, M. H., and Malik, S. 2001. Efficient conflict driven learning in a Boolean satisfiability solver. In Proceedings of the International Conference on Computer-Aided Design. 279--285."},{"volume-title":"Proceedings of the International Conference on Computer-Aided Verification. 17--36","author":"Zhang L.","key":"e_1_2_2_82_1","unstructured":"Zhang , L. and Malik , S . 2002. The quest for efficient boolean satisfiability solvers . In Proceedings of the International Conference on Computer-Aided Verification. 17--36 . Zhang, L. and Malik, S. 2002. The quest for efficient boolean satisfiability solvers. In Proceedings of the International Conference on Computer-Aided Verification. 17--36."},{"key":"e_1_2_2_83_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.09.007"}],"container-title":["ACM Transactions on Intelligent Systems and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2542182.2542200","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2542182.2542200","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:09:56Z","timestamp":1750234196000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2542182.2542200"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12]]},"references-count":82,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["10.1145\/2542182.2542200"],"URL":"https:\/\/doi.org\/10.1145\/2542182.2542200","relation":{},"ISSN":["2157-6904","2157-6912"],"issn-type":[{"type":"print","value":"2157-6904"},{"type":"electronic","value":"2157-6912"}],"subject":[],"published":{"date-parts":[[2013,12]]},"assertion":[{"value":"2011-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-01-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}