{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:42Z","timestamp":1725664062762},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540582168"},{"type":"electronic","value":"9783540485735"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58216-9_37","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:35:02Z","timestamp":1330270502000},"page":"174-188","source":"Crossref","is-referenced-by-count":3,"title":["Towards efficient calculi for resource-oriented deductive planning"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Br\u00fcning","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"O. L. Astrachan and M. E. Stickel. Caching and Lemmaizingin Model Elimination Theorem Provers. In Proceedings of the Conference on Automated Deduction, pages 224\u2013238. Springer, 1992.","DOI":"10.1007\/3-540-55602-8_168"},{"key":"13_CR2","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF03037438","volume":"4","author":"W. Bibel","year":"1986","unstructured":"W. Bibel. A deductive solution for plan generation. New Generation Computing, 4:115\u2013132, 1986.","journal-title":"New Generation Computing"},{"key":"13_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-90102-6","volume-title":"Automated Theorem Proving","author":"W. Bibel","year":"1987","unstructured":"W. Bibel. Automated Theorem Proving. Vieweg Verlag, Braunschweig, 1987."},{"key":"13_CR4","volume-title":"Deduction: Automated Logic","author":"W. Bibel","year":"1993","unstructured":"W. Bibel. Deduction: Automated Logic. Academic Press, London, 1993."},{"key":"13_CR5","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0304-3975(91)90004-L","volume":"86","author":"R. N. Bol","year":"1991","unstructured":"R. N. Bol, K. R. Apt, and J. W. Klop. An analysis of loop checking mechanisms for logic programming. Theoretical Computer Science, 86:35\u201379, 1991.","journal-title":"Theoretical Computer Science"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"S. Br\u00fcning. On Loop Detection in Connection Calculi. In Proceedings of the Kurt G\u00f6del Colloquium, pages 144\u2013151. Springer Verlag, 1993.","DOI":"10.1007\/BFb0022562"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"S. Br\u00fcning. Towards Efficient Calculi for Resource-Oriented Linear Deductive Planning. Technical report, FG Intellektik, FB Informatik, TH Darmstadt, 1993.","DOI":"10.1007\/3-540-58216-9_37"},{"key":"13_CR8","unstructured":"S. Br\u00fcning, G. Gro\u00dfe, S. H\u00f6lldobler, J. Schneeberger, U. Sigmund, and M. Thielscher. Disjunction in plan generation by equational logic programming. In Beitr\u00e4ge zum 7. Workshop Planen und Konfigurieren, pages 18\u201326. Arbeitspapiere der GMD 723, January 1993."},{"key":"13_CR9","unstructured":"R. Feldman and P. Morris. Admissible Criteria For Loop Control In Planning. In Proceedings of the Eigth National Conference on Artificial Intelligence, pages 151\u2013157, 1990."},{"issue":"2","key":"13_CR10","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0004-3702(71)90010-5","volume":"5","author":"R. E. Fikes","year":"1971","unstructured":"R. E. Fikes and N. J. Nilsson. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 5(2):189\u2013208, 1971.","journal-title":"Artificial Intelligence"},{"key":"13_CR11","unstructured":"B. Fronh\u00f6fer and R. Caferra. Memorization of literals: An enhancement of the connection method. Technical report, Institut f\u00fcr Informatik, TU M\u00fcnchen, 1988."},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"C. Green. Application of theorem proving to problem solving. In Proceedings of IJCAI 1969, pages 741\u2013747, 1969.","DOI":"10.21236\/ADA459656"},{"key":"13_CR13","unstructured":"G. Gro\u00dfe, S. H\u00f6lldobler, and J. Schneeberger. On linear deductive planning. Technical Report AIDA-92-08, FG Intellektik, FB Informatik, TH Darmstadt, 1992."},{"key":"13_CR14","unstructured":"Gerd Gro\u00dfe, Steffen H\u00f6lldobler, Josef Schneeberger, Ute Sigmund, and Michael Thielscher. Equational Logic Programming, Actions, and Change. In Proc. Joint International Conference and Symposium on Logic Programming JICSLP'92, 1992."},{"key":"13_CR15","doi-asserted-by":"crossref","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":"13_CR16","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 \u2014 A High-Performance Theorem Prover for First-Order Logic. JAR, 8:183\u2013212, 1992.","journal-title":"JAR"},{"key":"13_CR17","first-page":"1","volume-title":"On the semantics of STRIPS","author":"V. Lifschitz","year":"1986","unstructured":"V. Lifschitz. On the semantics of STRIPS. In Proc. of the Workshop on Reasoning about Actions and Plans, pages 1\u20138, Los Altos, 1986. Morgan Kaufmann."},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"M. Masseron, C. Tollu, and J. Vauzielles. Generating plans in linear logic. In Foundations of Software Technology and Theoretical Computer Science, pages 63\u201375. Springer, LNCS 472, 1990.","DOI":"10.1007\/3-540-53487-3_35"},{"key":"13_CR19","volume-title":"A semi-reactive planner based on a possible models action formalization","author":"S. Thi\u00e9baux","year":"1992","unstructured":"S. Thi\u00e9baux and J. Hertzberg. A semi-reactive planner based on a possible models action formalization. In Artificial Intelligence Planning Systems: Proceedings of the First International Conference (AIPS92), San Mateo, CA, 1992. Morgan Kaufmann."}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58216-9_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:18:40Z","timestamp":1605647920000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58216-9_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582168","9783540485735"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-58216-9_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}