{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T21:40:06Z","timestamp":1737063606785,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677970"},{"type":"electronic","value":"9783540449577"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44957-4_50","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T05:24:41Z","timestamp":1180675481000},"page":"747-761","source":"Crossref","is-referenced-by-count":2,"title":["Solving the Entailment Problem in the Fluent Calculus Using Binary Decision Diagrams"],"prefix":"10.1007","author":[{"given":"Steffen","family":"H\u00f6lldobler","sequence":"first","affiliation":[]},{"given":"Hans-Peter","family":"St\u00f6rr","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,12,15]]},"reference":[{"key":"50_CR1","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0004-3702(96)00047-1","volume":"90","author":"A. Blum","year":"1997","unstructured":"Avrim Blum and Merrick Furst. Fast planning through planning graph analysis. Artificial Intelligence, 90:281\u2013300, 1997.","journal-title":"Artificial Intelligence"},{"issue":"C-35","key":"50_CR2","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"8","author":"R. E. Bryant","year":"1986","unstructured":"Randal E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, 8(C-35):677\u2013691, 1986.","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"50_CR3","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/0890-5401(92)90017-A","volume":"98","author":"J. Burch","year":"1992","unstructured":"J. Burch, E. Clarke, K. McMillan, and D. Dill. Symbolic model checking: 1020 states and beyond. Information and Computation, 98(2):142\u2013170, 1992.","journal-title":"Information and Computation"},{"issue":"4","key":"50_CR4","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1109\/43.275352","volume":"13","author":"J. R. Burch","year":"1994","unstructured":"J. R. Burch, E. M. Clarke, D. E. Long, K. L. McMillan, and D. L. Dill. Symbolic model checking for sequential circuit verification. IEEE Transactions on Computer-Aided Design of Integrated Circuits, 13(4):401\u2013424, April 1994.","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits"},{"key":"50_CR5","doi-asserted-by":"crossref","unstructured":"A. Cimatti, E. Giunchiglia, F. Giunchiglia, and P. Traverso. \u201dplanning via model checking: A decision procedure for ar. In S. Steel and R. Alami, editors, Proceedings of the Fourth European Conference on Planning (ECP97), LNAI 1348, pages 130\u2013142, Toulouse, France, Sept. 1997. Springer-Verlag.","DOI":"10.1007\/3-540-63912-8_81"},{"key":"50_CR6","unstructured":"Alessandro Cimatti, Marco Roveri, and Paolo Traverso. Automatic OBDD-based generation of universal plans on non-deterministic domains. In Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI98), Madison, Wisconsin, July 26\u201330 1998."},{"key":"50_CR7","unstructured":"E. Clarke, O. Grunberg, and D. Long. Model checking. In Proceedings of the International Summer School on Deductive Program Design, Marktoberdorf, 1994."},{"key":"50_CR8","doi-asserted-by":"crossref","unstructured":"Stefan Edelkamp and Malte Helmert. Exhibiting knowledge in planning problems to minimize state encoding length. In ECP\u201999, LNAI, pages 135\u2013147, Durham, 1999. Springer.","DOI":"10.1007\/10720246_11"},{"key":"50_CR9","unstructured":"T. Eiter, N. Leone, C. Mateis, G. Pfeier, and F. Scarnello. The KR system DLV: Progress report, comparisons and benchmarks. In Proceedings of the 6th International Conference on Principles of Knowledge Representation and Reasoning, pages 406\u2013417. Morgan Kaufmann Publishers, 1998."},{"key":"50_CR10","unstructured":"M. Ghallab, A. Howe, C. Knoblock, D. McDermott, A. Ram, M. Veloso, D. Weld, and D. Wilkins. The planning domain definition language. ftp:\/\/ftp.cs.yale.edu\/pub\/mcdermott\/software\/pddl.tar.gz , march 1998."},{"key":"50_CR11","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF03037518","volume":"8","author":"S. H\u00f6lldobler","year":"1990","unstructured":"S. H\u00f6lldobler and J. Schneeberger. A new deductive approach to planning. New Generation Computing, 8:225\u2013244, 1990.","journal-title":"New Generation Computing"},{"key":"50_CR12","doi-asserted-by":"crossref","unstructured":"S. H\u00f6lldobler and H.-P. St\u00f6rr. Solving the entailment problem in the fluent calculus using binary decision diagrams. Technical Report WV-99-05, AI-Institute, Computer Science Department, Dresden University of Technology, 1999.","DOI":"10.1007\/3-540-44957-4_50"},{"key":"50_CR13","unstructured":"Henry Kautz and Bart Selman. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96), pages 1194\u20131201, Portland, Oregon, 1996. AAAI-Press."},{"key":"50_CR14","doi-asserted-by":"crossref","unstructured":"J. McCarthy. Situations and actions and causal laws. Stanford Artificial Intelligence Project: Memo 2, 1963.","DOI":"10.21236\/AD0785031"},{"key":"50_CR15","unstructured":"Drew McDermott. Planning problem repository. ftp:\/\/ftp.cs.yale.edu\/pub\/mcdermott\/domains\/ , 1999."},{"key":"50_CR16","doi-asserted-by":"crossref","unstructured":"I. Niemel\u00e4 and P. Simons. Smodels \u2014 an implementation of the well-founded and stable model semantics. In Proceedings of the 4th International Conderence on Logic Programming and Non-monotonic Reasoning, pages 420\u2013429, 1997.","DOI":"10.1007\/3-540-63255-7_32"},{"key":"50_CR17","unstructured":"B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In Proceedings of the AAAI National Conference on Artificial Intelligence, pages 440\u2013446, 1992."},{"key":"50_CR18","unstructured":"H.-P. St\u00f6rr. Planen mit bin\u00e4ren Entscheidungsdiagrammen. PhD thesis, Dresden University of Technology, Department of Computer Science, 2000. (in German; to appear)."},{"key":"50_CR19","doi-asserted-by":"crossref","unstructured":"H.-P. St\u00f6rr and M. Thielscher. A new equational foundation for the fluent calculus. In Proceedings CL 2000.","DOI":"10.1007\/3-540-44957-4_49"},{"issue":"3\u20134","key":"50_CR20","first-page":"179","volume":"2","author":"M. Thielscher","year":"1998","unstructured":"Michael Thielscher. Introduction to the Fluent Calculus. Electronic Transactions on Artificial Intelligence, 2(3\u20134):179\u2013192, 1998.","journal-title":"Electronic Transactions on Artificial Intelligence"},{"key":"50_CR21","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/S0004-3702(98)00084-8","volume":"104","author":"M. Thielscher","year":"1998","unstructured":"Michael Thielscher. Reasoning about actions: Steady versus stabilizing state constraints. Artificial Intelligence, 104:339\u2013355, 1998.","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Computational Logic \u2014 CL 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44957-4_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T21:04:21Z","timestamp":1737061461000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44957-4_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677970","9783540449577"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-44957-4_50","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}