{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:46:40Z","timestamp":1725544000625},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540343066"},{"type":"electronic","value":"9783540343073"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11757375_22","type":"book-chapter","created":{"date-parts":[[2006,5,19]],"date-time":"2006-05-19T03:59:15Z","timestamp":1148011155000},"page":"273-287","source":"Crossref","is-referenced-by-count":3,"title":["An Efficient Hybrid Strategy for Temporal Planning"],"prefix":"10.1007","author":[{"given":"Zhao","family":"Xing","sequence":"first","affiliation":[]},{"given":"Yixin","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Weixiong","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","unstructured":"http:\/\/planning.cis.strath.ac.uk\/competition"},{"key":"22_CR2","unstructured":"http:\/\/ls5-www.cs.uni-dortmund.de\/~edelkamp\/ipc-4"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/11527695_4","volume-title":"Theory and Applications of Satisfiability Testing","author":"M. Benedetti","year":"2005","unstructured":"Benedetti, M., Bernardini, S.: Incremental compilation-to-SAT procedures. In: H. Hoos, H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol.\u00a03542, pp. 46\u201358. Springer, Heidelberg (2005)"},{"key":"22_CR4","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.: Fast planning through planning graph analysis. Artificial Intelligence\u00a090, 281\u2013300 (1997)","journal-title":"Artificial Intelligence"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Bonet, B., Geffner, H.: Planning as heuristic search. Artificial Intelligence, Special issue on Heuristic Search\u00a0129(1) (2001)","DOI":"10.1016\/S0004-3702(01)00108-4"},{"key":"22_CR6","unstructured":"http:\/\/www.cril.univ-artois.fr\/~vidal\/cpt.fr.html"},{"key":"22_CR7","unstructured":"http:\/\/www.cs.washington.edu\/homes\/kautz\/satplan\/blackbox\/blackbox-download.html"},{"key":"22_CR8","unstructured":"Edelkamp, S.: Mixed propositional and numerical planning in the model checking integrated planning system. In: Proceedings of AIPS 2002, Workshop on Planning for Temporal Domains, pp. 47\u201355 (2002)"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0004-3702(71)90010-5","volume":"2","author":"R.E. Fikes","year":"1971","unstructured":"Fikes, R.E., Nilsson, N.J.: STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence\u00a02, 189\u2013208 (1971)","journal-title":"Artificial Intelligence"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-540-27813-9_8","volume-title":"Computer Aided Verification","author":"M. Awedh","year":"2004","unstructured":"Awedh, M., Jin, H., Somenzi, F.: CirCus: a satisfiability solver geared towards bounded model checking. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol.\u00a03114, pp. 519\u2013522. Springer, Heidelberg (2004)"},{"key":"22_CR11","unstructured":"Haslum, P.: TP4\u201904 and HSP. In: Proceedings of IPC4, ICAPS, pp. 38\u201340 (2004)"},{"key":"22_CR12","volume-title":"Introduction to Operations Research","author":"F. Hillier","year":"2001","unstructured":"Hillier, F., Lieberman, G.: Introduction to Operations Research, 7th edn. McGraw-Hill, Boston (2001)","edition":"7"},{"key":"22_CR13","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1613\/jair.855","volume":"14","author":"J. Hoffmann","year":"2001","unstructured":"Hoffmann, J., Nebel, B.: The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research\u00a014, 253\u2013302 (2001)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BF00881805","volume":"15","author":"J.N. Hooker","year":"1995","unstructured":"Hooker, J.N., Vinay, V.: Branching rules for satisfiability. Journal of Automated Reasoning\u00a015, 359\u2013383 (1995)","journal-title":"Journal of Automated Reasoning"},{"key":"22_CR15","unstructured":"Katukam, S., Kambhampati, S.: Learning explanation-based search control rules for partial order planning. In: Proceedings of AAAI 1994, pp. 582\u2013587 (1994)"},{"key":"22_CR16","unstructured":"Kautz, H.: SATPLAN04: Planning as satisfiability. In: Proceedings of IPC4, ICAPS (2004)"},{"key":"22_CR17","unstructured":"Kautz, H., Selman, B.: Unifying SAT-based and graph-based planning. In: Proceedings of IJCAI 1999, pp. 318\u2013325 (1999)"},{"key":"22_CR18","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1613\/jair.715","volume":"12","author":"J. Koehler","year":"2000","unstructured":"Koehler, J., Hoffmann, J.: On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm. Journal of Artificial Intelligence Research\u00a012, 338\u2013386 (2000)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"22_CR19","unstructured":"McDermott, D.: Estimated-regression planning for interactions with web services. In: Proceedings of AIPS 2002, pp. 204\u2013211 (2002)"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proceedings of the 38th Design Automation Conference (DAC 2001) (2001)","DOI":"10.1145\/378239.379017"},{"key":"22_CR21","unstructured":"Nigenda, R.S., Nguyen, X., Kambhampati, S.: AltAlt: Combining the advantages of Graphplan and heuristic state search. Technical report, Arizona State University (2000)"},{"issue":"2","key":"22_CR22","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/S0004-3702(98)00100-3","volume":"106","author":"J.L. Pollock","year":"1998","unstructured":"Pollock, J.L.: The logical foundations of goal-regression planning in autonomous agents. Artificial Intelligence\u00a0106(2), 267\u2013334 (1998)","journal-title":"Artificial Intelligence"},{"key":"22_CR23","unstructured":"Refanidis, I., Vlahavas, I.: The GRT planner. AI Magazine, 63\u201366 (2001)"},{"key":"22_CR24","unstructured":"Ryan, L.: Efficient algorithms for clause-learning SAT solvers. Master\u2019s thesis, Simon Fraser University (2003)"},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Selman, B., Kautz, H.: Planning as satisfiability. In: Proceedings ECAI 1992, pp. 359\u2013363 (1992)","DOI":"10.1038\/359363a0"},{"key":"22_CR26","doi-asserted-by":"crossref","unstructured":"Shtrichman, O.: Tuning SAT checkers for bounded model checking. In: Computer Aided Verification, pp. 480\u2013494 (2000)","DOI":"10.1007\/10722167_36"},{"key":"22_CR27","unstructured":"Vidal, V., Geffner, H.: CPT: An optimal temporal POCL planner based on constraint programming. In: Proceedings of IPC4, ICAPS, pp. 59\u201360 (2004)"},{"key":"22_CR28","doi-asserted-by":"crossref","unstructured":"Wolfman, S., Weld, D.: Combining linear programming and satisfiability solving for resource planning. The Knowledge Engineering Review\u00a015(1) (2000)","DOI":"10.1017\/S0269888901000017"},{"key":"22_CR29","unstructured":"Hsu, C., Chen, Y., Wah, B.W.: SGPlan: Subgoal partitioning and resolution in planning. In: Proceedings of IPC4, ICAPS, pp. 30\u201332 (2004)"},{"key":"22_CR30","unstructured":"Zhang, L., Madigan, C.F., Moskewicz, M.W., Malik, S.: Efficient conflict driven learning in boolean satisfiability solver. In: ICCAD, pp. 279\u2013285 (2001)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11757375_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,27]],"date-time":"2021-07-27T07:19:55Z","timestamp":1627370395000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11757375_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343066","9783540343073"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/11757375_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}