{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:11:47Z","timestamp":1725484307708},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439417"},{"type":"electronic","value":"9783540456223"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45622-8_7","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T14:45:20Z","timestamp":1179931520000},"page":"83-98","source":"Crossref","is-referenced-by-count":9,"title":["Symbolic Heuristic Search Using Decision Diagrams"],"prefix":"10.1007","author":[{"given":"Eric","family":"Hansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengzhu","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,7,9]]},"reference":[{"key":"7_CR1","unstructured":"Cimatti, A., Roveri, M., Traverso, P.: Automatic OBDD-based generation of universal plans in non-deterministic domains. In: Proceedings of the Fifteenth National Conference on Artificial Intelligence. (1998) 875\u2013881"},{"key":"7_CR2","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1613\/jair.774","volume":"13","author":"M. Cimatti","year":"2000","unstructured":"Cimatti, M., Roveri, M.: Conformant planning via symbolic model checking. Journal of Artificial Intelligence Research 13 (2000) 305\u2013338","journal-title":"Journal of Artificial Intelligence Research"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Edelkamp, S., Reffel, F.: OBDDs in heuristic search. In: German Conference on Artificial Intelligence (KI). (1998) 81\u201392","DOI":"10.1007\/BFb0095430"},{"key":"7_CR4","unstructured":"Edelkamp, S., Reffel, F.: Deterministic state space planning with BDDs. In: Proceedings of the 5th European Conference on Planning (ECP-99). (1999) 381\u20132"},{"key":"7_CR5","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1613\/jair.649","volume":"13","author":"R. Jensen","year":"2000","unstructured":"Jensen, R., Veloso, M.: OBDD-based universal planning for synchronized agents in non-deterministic domains. Journal of Artificial Intelligence Research 13 (2000) 189\u2013226","journal-title":"Journal of Artificial Intelligence Research"},{"key":"7_CR6","unstructured":"Jensen, R.: OBDD-based deterministic planning using the UMOP planning frame-work. In: Proceedings of the AIPS-00 Workshop on Model-Theoretic Approaches to Planning. (2000) 26\u201331"},{"key":"7_CR7","unstructured":"Hoey, J., St-Aubin, R., Hu, A., outilier, C.: SPUDD: Stochastic planning using decision diagrams. In: Proceedings of the Fifteenth Conference on Uncertainty in Articial Intelligence. (1999) 279\u2013288"},{"key":"7_CR8","unstructured":"St-Aubin, R., Hoey, J., Boutilier, C.: APRICODD: Approximate policy construction using decision diagrams. In: Proceedings of NIPS-2000. (2000)"},{"key":"7_CR9","volume-title":"Dynamic Programming and Optimal Control","author":"D. Bertsekas","year":"1995","unstructured":"Bertsekas, D.: Dynamic Programming and Optimal Control. Athena Scientific, Belmont, MA (1995)"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Science and Cybernetics (SSC-4) 100\u2013107","DOI":"10.1109\/TSSC.1968.300136"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0004-3702(01)00106-0","volume":"129","author":"E. Hansen","year":"2001","unstructured":"Hansen, E., Zilberstein, S.: LAO*: A heuristic search algorithm that finds solutions with loops. Artificial Intelligence 129 (2001) 35\u201362","journal-title":"Artificial Intelligence"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers C-35 (1986) 677\u2013691","journal-title":"IEEE Transactions on Computers"},{"key":"7_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3190-6","volume-title":"Symbolic Model Checking","author":"K.L. McMillan","year":"1993","unstructured":"K.L. McMillan: Symbolic Model Checking. Kluwer Academic Publishers, Norwell Massachusetts (1993)"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"R. Bahar, E. Frohm, C. Gaona, G. Hachtel, E. Macii, A. Pardo, F. Somenzi: Algebraic Decision Diagrams and Their Applications. In: IEEE\/ACM International Conference on CAD, IEEE Computer Society Press (1993) 188\u2013191","DOI":"10.1109\/ICCAD.1993.580054"},{"key":"7_CR15","unstructured":"Somenzi, F.: Binary decision diagrams. In Broy, M., Steinbruggen, R., eds.: Calculational System Design. Volume 173 of NATO Science Series F: Computer and Systems Sciences. IOS Press (1999) 303\u2013366"},{"key":"7_CR16","unstructured":"Edelkamp, S.: Directed symbolic exploration in AI-planning. In: AAAI Spring Symposium on Model-based Validation of Intelligence, Stanford University (2001) 84\u201392"},{"key":"7_CR17","unstructured":"Somenzi, F.: CUDD: CU decision diagram package. ftp:\/\/vlsi.colorado.edu\/pub\/ (1998)"},{"key":"7_CR18","unstructured":"Daniele, M., Traverso, P., Vardi, M.: Strong cyclic planning revisited. In: Proceedings of the 5th European Conference on Planning (ECP-99). (1999)"},{"key":"7_CR19","volume-title":"Principles of Artificial Intelligence","author":"N. Nilsson","year":"1980","unstructured":"Nilsson, N.: Principles of Artificial Intelligence. Tioga Publishing Co., Palo Alto, CA (1980)"},{"key":"7_CR20","unstructured":"Feng, Z., Hansen, E.: Symbolic heuristic search for factored Markov decision processes. (2002) Proceedings of the 18th National Conference on Artificial Intelligence (AAAI-02)."}],"container-title":["Lecture Notes in Computer Science","Abstraction, Reformulation, and Approximation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45622-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T03:31:10Z","timestamp":1556422270000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45622-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439417","9783540456223"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-45622-8_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}