{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:32:46Z","timestamp":1725485566068},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540000105"},{"type":"electronic","value":"9783540360780"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36078-6_10","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T02:48:36Z","timestamp":1180666116000},"page":"145-159","source":"Crossref","is-referenced-by-count":1,"title":["Directed Automated Theorem Proving"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Edelkamp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Leven","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,24]]},"reference":[{"key":"10_CR1","unstructured":"J. Allen, J. Hendler, and A. Tate, editors. Readings in Planning. Morgan Kaufmann, 1990."},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0004-3702(99)00071-5","volume":"116","author":"F. Bacchus","year":"2000","unstructured":"F. Bacchus and F. Kabanza. Using temporal logics to express search control knowledge for planning. Artificial Intelligence, 116:123\u2013191, 2000.","journal-title":"Artificial Intelligence"},{"key":"10_CR3","unstructured":"B. Barras, S. Boutin, C. Cornes, J. Courant, J. C. Filliatre, E. Gim\u00e9nez, H. Herbelin, G. Huet, C. Munoz, C. Murthy, C. Parent, C. Paulin, A. Sa\u00efbi, and B. Werner. The Coq Proof Assistant Reference Manual-Version V6.1. Technical Report 0203, INRIA, 1997."},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/363647.363681","volume":"48","author":"D. Basin","year":"2001","unstructured":"D. Basin and H. Ganzinger. Automated complexity analysis based on ordered resolution. Journal of the ACM, 48(1):70\u2013109, 2001.","journal-title":"Journal of the ACM"},{"issue":"6","key":"10_CR5","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1017\/S095679680000201X","volume":"6","author":"G. S. Brodal","year":"1996","unstructured":"G. S. Brodal and C. Okasaki. Optimal purely functional priority queues. Journal of Functional Programming, 6(6):839\u2013857, 1996.","journal-title":"Journal of Functional Programming"},{"key":"10_CR6","unstructured":"E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 1999."},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. W. Dijkstra","year":"1959","unstructured":"E. W. Dijkstra. A note on two problems in connection with graphs. Numerische Mathematik, 1:269\u2013271, 1959.","journal-title":"Numerische Mathematik"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","volume":"3","author":"W. Dowling","year":"1984","unstructured":"W. Dowling and J. Gallier. Linear-time algorithms for testing the satisfiability of propositional horn formulae. Journal of Logic Programming, 3:267\u2013284, 1984.","journal-title":"Journal of Logic Programming"},{"key":"10_CR9","series-title":"Lect Notes Comput Sci","first-page":"13","volume-title":"European Conference on Planning (ECP)","author":"S. Edelkamp","year":"2001","unstructured":"S. Edelkamp. Planning with pattern databases. In European Conference on Planning (ECP), Lecture Notes in Computer Science. Springer, 2001. 13\u201324."},{"key":"10_CR10","unstructured":"S. Edelkamp, A. Lluch-Lafuente, and S. Leue. Protocol verification with heuristic search. In AAAI-Spring Symposium on Model-based Validation of Intelligence, pages 75\u201383, 2001."},{"issue":"3","key":"10_CR11","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M. L. Fredman","year":"1987","unstructured":"M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithm. Journal of the ACM, 34(3):596\u2013615, 1987.","journal-title":"Journal of the ACM"},{"key":"10_CR12","unstructured":"M. Genesereth and N. Nilsson. Logical Foundations of Artificial Intelligence. Morgan Kaufmann, 1987."},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"M. Gordon. HOL: A proof generating system for higher-order logic. In G. Birtwistle and P. A. Subrahmanyam, editors, VLSI Specification, Verification, and Synthesis. Kluwer, 1987.","DOI":"10.1007\/978-1-4613-2007-4_3"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"J. Harrison. Optimizing proof search in model elimination. In Conference on Automated Deduction (CADE), pages 313\u2013327, 1996.","DOI":"10.1007\/3-540-61511-3_97"},{"key":"10_CR15","first-page":"100","volume":"4","author":"P.E. Hart","year":"1968","unstructured":"P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for heuristic determination of minimum path cost. IEEE Trans. on SSC, 4:100, 1968.","journal-title":"IEEE Trans. on SSC"},{"key":"10_CR16","unstructured":"M. Helmert. Decidability and undecidability results for planning with numerical state variables. In Artificial Intelligence Planning and Scheduling (AIPS), 2002."},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1006\/jcss.1998.1581","volume":"57","author":"T. A. Henzinger","year":"1998","unstructured":"T. A. Henzinger, P. W. A. Puri, and P. Varaiya. What\u2019s decidable about hybrid automata? Journal of Computer and System Sciences, 57:94\u2013124, 1998.","journal-title":"Journal of Computer and System Sciences"},{"key":"10_CR18","first-page":"253","volume":"14","author":"J. Hoffmann","year":"2001","unstructured":"J. Hoffmann and B. Nebel. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Research (JAIR), 14:253\u2013302, 2001.","journal-title":"Journal of Artificial Research (JAIR)"},{"issue":"1","key":"10_CR19","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0004-3702(93)90045-D","volume":"62","author":"R. E. Korf","year":"1993","unstructured":"R. E. Korf. Linear-space best-first search. Artificial Intelligence, 62(1):41\u201378, 1993.","journal-title":"Artificial Intelligence"},{"issue":"2","key":"10_CR20","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF00244282","volume":"8","author":"R. Letz","year":"1992","unstructured":"R. Letz, J. Schumann, S. Bayerl, and W. Bibel. SETHEO: A high-performance theorem prover. Journal of Automated Reasoning, 8(2):183\u2013212, Apr. 1992.","journal-title":"Journal of Automated Reasoning"},{"key":"10_CR21","first-page":"73","volume-title":"Machine Intelligence 4","author":"D. W. Loveland","year":"1969","unstructured":"D. W. Loveland. Theorem-provers combining model elimination and resolution. In B. Meltzer and D. Michie, editors, Machine Intelligence 4, pages 73\u201386. University Press, Edinburgh, 1969."},{"key":"10_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL \u2014 A Proof Assistant for Higher-Order Logic","author":"T. Nipkow","year":"2002","unstructured":"T. Nipkow, L. C. Paulson, and M. Wenzel. Isabelle\/HOL \u2014 A Proof Assistant for Higher-Order Logic, volume 2283 of LNCS. Springer, 2002."},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"C. Okasaki. Purely Functional Data Structures, chapter 3. Cambridge University Press, 1998.","DOI":"10.1017\/CBO9780511530104"},{"key":"10_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/3-540-61474-5_91","volume-title":"Computer-Aided Verification (CAV)","author":"S. Owre","year":"1996","unstructured":"S. Owre, S. Rajan, J. M. Rushby, N. Shankar, and M. K. Srivas. PVS: Combining specification, proof checking, and model checking. In Computer-Aided Verification (CAV), Lecture Notes in Computer Science, pages 411\u2013414. Springer, 1996."},{"key":"10_CR25","unstructured":"L. C. Paulson. Strategic principles in the design of Isabelle. In Proceedings of the CADE Workshop on Strategies in Automated Deduction, pages 11\u201316, 1998."},{"key":"10_CR26","unstructured":"J. Pearl. Heuristics. Addison-Wesley, 1985."},{"key":"10_CR27","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/3-540-48119-2_13","volume-title":"World Congress on Formal Methods (FM)","author":"F. Reffel","year":"1999","unstructured":"F. Reffel and S. Edelkamp. Error detection with directed symbolic model checking. In World Congress on Formal Methods (FM), Lecture Notes in Computer Science, pages 195\u2013211. Springer, 1999."},{"issue":"7","key":"10_CR28","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1109\/34.297950","volume":"16","author":"A. Reinefeld","year":"1994","unstructured":"A. Reinefeld and T. Marsland. Enhanced iterative-deepening search. IEEE Transactions on Pattern Analysis and Machine Intelligence, 16(7):701\u2013710, 1994.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"10_CR29","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/3-540-16780-3_122","volume":"230","author":"M. E. Stickel","year":"1986","unstructured":"M. E. Stickel. A Prolog technology theorem prover: Implementation by an extended Prolog compiler. In Conference on Automated Deduction (CADE), volume 230, pages 573\u2013587. Springer, 1986.","journal-title":"Conference on Automated Deduction (CADE)"},{"key":"10_CR30","unstructured":"N. Voelker, 2002. Personal Communication."}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36078-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T15:18:00Z","timestamp":1556464680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36078-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540000105","9783540360780"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-36078-6_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}