{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T22:40:06Z","timestamp":1684968006823},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1997,12,1]],"date-time":"1997-12-01T00:00:00Z","timestamp":880934400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["NGCO"],"published-print":{"date-parts":[[1997,12]]},"DOI":"10.1007\/bf03037298","type":"journal-article","created":{"date-parts":[[2009,4,22]],"date-time":"2009-04-22T02:01:32Z","timestamp":1240365692000},"page":"369-402","source":"Crossref","is-referenced-by-count":1,"title":["Globally linear connection method"],"prefix":"10.1007","volume":"15","author":[{"given":"Stefan","family":"Br\u00fcning","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF03037298_CR1","volume-title":"Readings in Planning","author":"J. Allen","year":"1990","unstructured":"Allen, J., Hendler, J., and Tate, A.,Readings in Planning, Morgan Kaufmann, San Mateo, 1990."},{"key":"BF03037298_CR2","unstructured":"Baker, A. B., \u201cA Simple Solution to the Yale Shooting Problem,\u201d inProceedings of the International Conference on the Principles of Knowledge Representation and Reasoning, pp. 11\u201320, 1989."},{"key":"BF03037298_CR3","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF03037438","volume":"4","author":"W. Bibel","year":"1986","unstructured":"Bibel, W., \u201cA Deductive Solution for Plan Generation,\u201dNew Generation Computing, 4, pp. 115\u2013132, 1986.","journal-title":"New Generation Computing"},{"key":"BF03037298_CR4","doi-asserted-by":"crossref","unstructured":"Bibel, W.,Automated Theorem Proving, second edition, Vieweg Verlag, 1987.","DOI":"10.1007\/978-3-322-90102-6"},{"issue":"5","key":"BF03037298_CR5","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1093\/logcom\/3.5.517","volume":"3","author":"G. Brewka","year":"1993","unstructured":"Brewka, G. and Hertzberg, J., \u201cHow to Do Things with Worlds \u2014 On Formalizing Actions and Plans,\u201dLogic and Computation, 3, 5, pp. 517\u2013532, 1993.","journal-title":"Logic and Computation"},{"key":"BF03037298_CR6","unstructured":"Br\u00fcning, S., Grosse, G., H\u00f6lldobler, S., Schneeberger, J., Sigmund, U., and Thielscher, M., \u201cOn Disjunction in Linear Logic Programming\u201d (extended abstract), inProceedings of the Workshop on Linear Logic and Logic Programming (D. Miller, ed.),MS-CIS-92-80, University of Pennsylvania, School of Engineering and Applied Science, Computer and Information Science Department, pp. 53\u201359, 1992."},{"key":"BF03037298_CR7","unstructured":"Br\u00fcning, S., Grosse, G., H\u00f6lldobler, S., Schneeberger, J., Sigmund, U., and Thielscher, M., \u201cDisjunction in Plan Generation by Equational Logic Programming,\u201d inBeitr\u00e4ge zum 7. Workshop Planen und Konfigurieren (A. Horz, ed.),Arbeitspapiere der GMD 723, pp. 18\u201326, January 1993."},{"key":"BF03037298_CR8","unstructured":"Br\u00fcning, S., \u201cTechniques for Avoiding Redundancy in Theorem Proving Based on the Connection Method,\u201dPh. D. thesis, TH Darmstadt, 1994."},{"key":"BF03037298_CR9","doi-asserted-by":"crossref","unstructured":"Br\u00fcning, S., \u201cTowards Efficient Calculi for Resource-Oriented Linear Deductive Planning,\u201d inProceedings of the International Conference on Logic Programming and Automated Reasoning (F. Pfenning, ed.),volume 822 of Lecture Notes in Artificial Intelligence, Springer-Verlag, pp. 174\u2013188, 1994.","DOI":"10.1007\/3-540-58216-9_37"},{"issue":"2","key":"BF03037298_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":"Fikes, R. E. and Nilsson, N. J., \u201cSTRIPS: A New Approach to the Application of Theorem Proving to Problem Solving,\u201dArtificial Intelligence, 5, 2, pp. 189\u2013208, 1971.","journal-title":"Artificial Intelligence"},{"key":"BF03037298_CR11","unstructured":"Fronh\u00f6fer B. and Caferra, R., \u201cMemorization of Literals: An Enhancement of the Connection Method,\u201dTechnical Report, Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen, 1988."},{"key":"BF03037298_CR12","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF03037463","volume":"5","author":"B. Fronh\u00f6fer","year":"1987","unstructured":"Fronh\u00f6fer, B., \u201cLinearity and Plan Generation,\u201dNew Generation Computing, 5, pp. 213\u2013225, 1987.","journal-title":"New Generation Computing"},{"key":"BF03037298_CR13","unstructured":"Grosse, G., H\u00f6lldobler, S., and Schneeberger, J., \u201cOn Linear Deductive Planning,\u201dTechnical Report, AIDA-92-08, FG Intellektik, FB Informatik, TH Darmstadt, 1992. Accepted for publication in theJournal of Logic and Computation."},{"key":"BF03037298_CR14","unstructured":"Grosse, G., H\u00f6lldobler, S., Schneeberger, J., Sigmund, U., and Thielscher, M., \u201cEquational Logic Programming, Actions, and Change,\u201d inProc. Joint International Conference and Symposium on Logic Programming JICSLP\u201992, 1992."},{"key":"BF03037298_CR15","unstructured":"Hanks, S. and McDermott, D., \u201cDefault Reasoning, Nonmonotonic Logics, and the Frame Problem,\u201d inNational Conference on Artificial Intelligence, pp. 328\u2013333, 1986."},{"key":"BF03037298_CR16","series-title":"Readings in Planning","volume-title":"Artificial and Human Thinking","author":"P. J. Hayes","year":"1990","unstructured":"Hayes, P. J., \u201cThe Frame Problem and Related Problems in Artificial Intelligence,\u201d inArtificial and Human Thinking (A. Eilithron and D. Jones, eds.), Jossey-Bass Publishers, 1983. Also published inReadings in Planning (J. Allen et al.), Morgan Kaufmann, San Moteo, 1990."},{"key":"BF03037298_CR17","unstructured":"Hertzberg, J.,Planen: Einf\u00fchrung in die Planerstellungsmethoden der k\u00fcnstlichen Intelligenz, volume 65 of Reihe Informatik, BI-Wissenschaftsverlag, 1989."},{"key":"BF03037298_CR18","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF03037518","volume":"8","author":"S. H\u00f6lldobler","year":"1990","unstructured":"H\u00f6lldobler, S. and Schneeberger, J., \u201cA New Deductive Approach to Planning,\u201dNew Generation Computing, 8, pp. 225\u2013244, 1990. A short version appeared in theProceedings of the German Workshop on Artificial Intelligence, Informatik Fachberichte 216, pp. 63\u201373, 1989.","journal-title":"New Generation Computing"},{"key":"BF03037298_CR19","unstructured":"H\u00f6lldobler, S. and Thielscher, M., \u201cComputing Change and Specificity with Equational Logic Programs,\u201dAnnals of Mathematics and Artificial Intelligence, special issue on Processing of Declarative Knowledge, 1994. To appear."},{"key":"BF03037298_CR20","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF00244282","volume":"8","author":"R. Letz","year":"1992","unstructured":"Letz, R., Schumann, J., Bayerl, S., and Bibel, W., \u201cSETHEO \u2014 A High-Performance Theorem Prover for First-Order Logic,\u201dJournal of Automated Reasoning, 8, pp. 183\u2013212, 1992.","journal-title":"Journal of Automated Reasoning"},{"issue":"3","key":"BF03037298_CR21","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF00881947","volume":"13","author":"R. Letz","year":"1994","unstructured":"Letz, R., Mayr, K., and Goller, Ch., \u201cControlled Integrations of the Cut Rule into Connection Tableau Calculi,\u201dJournal of Automated Reasoning, 13, 3, pp. 297\u2013338, 1994, Special Issue on Automated Reasoning with Analytic Tableaux.","journal-title":"Journal of Automated Reasoning"},{"key":"BF03037298_CR22","unstructured":"Letz, R., \u201cFirst-Order Calculi and Proof Procedures for Automated Deduction,\u201dPh. D. thesis, TH Darmstadt, 1993."},{"key":"BF03037298_CR23","first-page":"1","volume-title":"Proc. of the Workshop on Reasoning about Actions and Plans","author":"V. Lifschitz","year":"1986","unstructured":"Lifschitz, V., \u201cOn the Semantics of STRIPS,\u201d inProc. of the Workshop on Reasoning about Actions and Plans (M. P. Georgeff and A. L. Lansky, eds.), Los Altos, Morgan Kaufmann, pp. 1\u20138, 1986."},{"key":"BF03037298_CR24","doi-asserted-by":"crossref","unstructured":"Lifschitz, V., \u201cFormal Theories of Action\u201d (preliminary report), inInternational Joint Conference on Artificial Intelligence, Morgan Kaufmann Publishers, Inc., pp. 966\u2013972, August 1987.","DOI":"10.1016\/B978-0-934613-32-3.50009-5"},{"key":"BF03037298_CR25","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/321450.321456","volume":"15","author":"D. W. Loveland","year":"1986","unstructured":"Loveland, D. W., \u201cMechanical Theorem Proving by Model Elimination,\u201dJournal of the ACM, 15, pp. 236\u2013251, 1986.","journal-title":"Journal of the ACM"},{"key":"BF03037298_CR26","doi-asserted-by":"crossref","unstructured":"Masseron, M., Tollu, C., and Vauzeilles, J., \u201cGenerating Plans in Linear Logic,\u201dPr\u00e9-publication, 90\u201311, Centre Scientifique et Polytechnique, Universite Paris Nord, December 1990.","DOI":"10.1007\/3-540-53487-3_35"},{"key":"BF03037298_CR27","doi-asserted-by":"crossref","unstructured":"Masseron, M., Tollu, C., and Vauzielles, J., \u201cGenerating Plans in Linear Logic,\u201d inFoundations of Software Technology and Theoretical Computer Science, LNCS, 472, Springer-Verlag, pp. 63\u201375, 1990.","DOI":"10.1007\/3-540-53487-3_35"},{"key":"BF03037298_CR28","first-page":"463","volume-title":"Machine Intelligence","author":"J. McCarthy","year":"1969","unstructured":"McCarthy, J. and Hayes, P., \u201cSome Philosophical Problems from the Standpoint of Artificial Intelligence,\u201d inMachine Intelligence, vol. 4 (B. Meltzer and D. Michie, eds.), Edinburgh University Press, Edinburgh, pp. 463\u2013502, 1969. Also published inReadings in Planning (J. Allen et al.), Morgan Kaufmann, San Mateo, 1990."},{"key":"BF03037298_CR29","doi-asserted-by":"crossref","unstructured":"McCarthy, J., \u201cSituations and Actions and Causal Laws,\u201dStanford Artificial Intelligence Project: Memo 2, 1963.","DOI":"10.21236\/AD0785031"},{"key":"BF03037298_CR30","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0004-3702(86)90032-9","volume":"28","author":"J. McCarthy","year":"1986","unstructured":"McCarthy, J., \u201cApplications of Circumscription to Formalize Commonsense Knowledge,\u201dArtificial Intelligence, 28, pp. 89\u2013116, 1986.","journal-title":"Artificial Intelligence"},{"key":"BF03037298_CR31","unstructured":"Schneeberger, J., \u201cPlan Generation by Linear Deduction,\u201dPh. D. thesis, FG Intellektik, TH Darmstadt, 1992."},{"key":"BF03037298_CR32","volume-title":"Formal Techniques in Artificial Intelligence, A Sourcebook","author":"J. H. Siekmann","year":"1990","unstructured":"Siekmann, J. H., \u201cAn Introduction to Unification Theory,\u201d inFormal Techniques in Artificial Intelligence, A Sourcebook (R. B. Banerji, ed.), Elsevier Science Publishers B. V., North-Holland, 1990."},{"key":"BF03037298_CR33","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF00297245","volume":"4","author":"M. E. Stickel","year":"1988","unstructured":"Stickel, M. E., \u201cA Prolog Technology Theorem Prover: Implementation by an Extended Prolog Compiler,\u201dJournal of Automated Reasoning, 4, pp. 353\u2013380, 1988.","journal-title":"Journal of Automated Reasoning"},{"key":"BF03037298_CR34","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1007\/3-540-52885-7_136","volume-title":"10th International Conference on Automated Deduction","author":"M. E. Stickel","year":"1990","unstructured":"Stickel, M. E., \u201cA Prolog Technology Theorem Prover,\u201d in10th International Conference on Automated Deduction (M. E. Stickel, ed.), Berlin, pp. 673\u2013674, 1990.Lecture Notes in Artificial Intelligence, 449, Springer-Verlag."},{"key":"BF03037298_CR35","unstructured":"Sussman, G. J.,A Computer Model of Skill Acquisition, Elsevier Publishing Company, 1975."},{"key":"BF03037298_CR36","unstructured":"Thielscher, M.,Automatisierte Schliessen \u00fcber Kausalbeziehungen mit SLDENF-Resolution, DISKI, Infix-Verlag, 1995. To appear."},{"key":"BF03037298_CR37","unstructured":"Winslett, M., \u201cResoning about Action Using a Possible Models approach,\u201d inProceedings of the AAAI National Conference on Artificial Intelligence, pp. 89\u201393, 1988."}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037298.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03037298\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037298","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T22:09:07Z","timestamp":1684966147000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03037298"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,12]]},"references-count":37,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1997,12]]}},"alternative-id":["BF03037298"],"URL":"https:\/\/doi.org\/10.1007\/bf03037298","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,12]]}}}