{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T10:19:50Z","timestamp":1768558790767,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540261728","type":"print"},{"value":"9783540319276","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11493402_3","type":"book-chapter","created":{"date-parts":[[2010,7,12]],"date-time":"2010-07-12T21:52:26Z","timestamp":1278971546000},"page":"35-52","source":"Crossref","is-referenced-by-count":4,"title":["Partial Deduction for Linear Logic\u2014The Symbolic Negotiation Perspective"],"prefix":"10.1007","author":[{"given":"Peep","family":"K\u00fcngas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mihhail","family":"Matskin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-540-25932-9_14","volume-title":"Declarative Agent Languages and Technologies","author":"P. K\u00fcngas","year":"2004","unstructured":"K\u00fcngas, P., Matskin, M.: Linear logic, partial deduction and cooperative problem solving. In: Leite, J., Omicini, A., Sterling, L., Torroni, P. (eds.) DALT 2003. LNCS (LNAI), vol.\u00a02990, pp. 263\u2013279. Springer, Heidelberg (2004)"},{"key":"3_CR2","unstructured":"Komorowski, J.: A Specification of An Abstract Prolog Machine and Its Application to Partial Evaluation. PhD thesis, Department of Computer and Information Science, Linkoping University, Linkoping, Sweden (1981)"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.Y. Girard","year":"1987","unstructured":"Girard, J.Y.: Linear logic. Theoretical Computer Science\u00a050, 1\u2013102 (1987)","journal-title":"Theoretical Computer Science"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0168-0072(94)90011-6","volume":"67","author":"M.I. Kanovich","year":"1994","unstructured":"Kanovich, M.I.: Linear logic as a logic of computations. Annals of Pure and Applied Logic\u00a067, 183\u2013212 (1994)","journal-title":"Annals of Pure and Applied Logic"},{"key":"3_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/3-540-44404-1_29","volume-title":"Logic for Programming and Automated Reasoning","author":"H. Lehmann","year":"2000","unstructured":"Lehmann, H., Leuschel, M.: Solving planning problems by partial deduction. In: Parigot, M., Voronkov, A. (eds.) LPAR 2000. LNCS (LNAI), vol.\u00a01955, pp. 451\u2013467. Springer, Heidelberg (2000)"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0743-1066(91)90027-M","volume":"11","author":"J.W. Lloyd","year":"1991","unstructured":"Lloyd, J.W., Shepherdson, J.C.: Partial evaluation in logic programming. Journal of Logic Programming\u00a011, 217\u2013242 (1991)","journal-title":"Journal of Logic Programming"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1145\/130956.130958","volume":"23","author":"P. Lincoln","year":"1992","unstructured":"Lincoln, P.: Linear logic. ACM SIGACT Notices\u00a023, 29\u201337 (1992)","journal-title":"ACM SIGACT Notices"},{"key":"3_CR8","series-title":"London Mathematical Society Lecture Note Series","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1017\/CBO9780511629150.006","volume-title":"Advances in Linear Logic","author":"P. Lincoln","year":"1995","unstructured":"Lincoln, P.: Deciding provability of linear logic formulas. In: Girard, J.Y., Lafont, Y., Regnier, L. (eds.) Advances in Linear Logic. London Mathematical Society Lecture Note Series, vol.\u00a0222, pp. 109\u2013122. Cambridge University Press, Cambridge (1995)"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1017\/S0960129501003413","volume":"11","author":"M.I. Kanovich","year":"2001","unstructured":"Kanovich, M.I., Vauzeilles, J.: The classical AI planning problems in the mirror of Horn linear logic: Semantics, expressibility, complexity. Mathematical Structures in Computer Science\u00a011, 689\u2013716 (2001)","journal-title":"Mathematical Structures in Computer Science"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E. Mayr","year":"1984","unstructured":"Mayr, E.: An algorithm for the general Petri net reachability problem. SIAM Journal on Computing\u00a013, 441\u2013460 (1984)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BF00885763","volume":"12","author":"T. Tammet","year":"1994","unstructured":"Tammet, T.: Proof strategies in linear logic. Journal of Automated Reasoning\u00a012, 273\u2013304 (1994)","journal-title":"Journal of Automated Reasoning"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"R.M. Karp","year":"1969","unstructured":"Karp, R.M., Miller, R.E.: Parallel program schemata. Journal of Computer and Systems Sciences\u00a03, 147\u2013195 (1969)","journal-title":"Journal of Computer and Systems Sciences"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/BF03037301","volume":"15","author":"J.M. Andreoli","year":"1997","unstructured":"Andreoli, J.M., Pareschi, R., Castagnetti, T.: Static analysis of linear logic programming. New Generation Computing\u00a015, 449\u2013481 (1997)","journal-title":"New Generation Computing"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/351268.351298","volume-title":"Proceedings of the 2nd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, PPDP 2000","author":"M. Leuschel","year":"2000","unstructured":"Leuschel, M., Lehmann, H.: Solving coverability problems of Petri nets by partial deduction. In: Proceedings of the 2nd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, PPDP 2000, Montreal, Canada, September 20\u201323, pp. 268\u2013279. ACM Press, New York (2000)"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0743-1066(99)00030-8","volume":"41","author":"D. Schreye de","year":"1999","unstructured":"de Schreye, D., Gl\u00fcck, R., J\u00f8rgensen, J., Leuschel, M., Martens, B., S\u00f8rensen, M.H.: Conjunctive partial deduction: Foundations, control, algorithms and experiments. Journal of Logic Programming\u00a041, 231\u2013277 (1999)","journal-title":"Journal of Logic Programming"},{"key":"3_CR16","first-page":"23","volume":"30","author":"M. Matskin","year":"1997","unstructured":"Matskin, M., Komorowski, J.: Partial structural synthesis of programs. Fundamenta Informaticae\u00a030, 23\u201341 (1997)","journal-title":"Fundamenta Informaticae"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/0743-1066(94)90035-3","volume":"19\/20","author":"S. Muggleton","year":"1994","unstructured":"Muggleton, S., de Raedt, L.: Inductive logic programming: Theory and methods. Journal of Logic Programming\u00a019\/20, 629\u2013679 (1994)","journal-title":"Journal of Logic Programming"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Harland, J., Pym, D., Winikoff, M.: Forward and backward chaining in linear logic. In: Proceedings of the CADE-17 Workshop on Proof-Search in Type-Theoretic Systems, Pittsburgh, June 20\u201321, 2000. Electronic Notes in Theoretical Computer Science, vol.\u00a037. Elsevier, Amsterdam (2000)","DOI":"10.1016\/S1571-0661(05)01136-9"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/0004-3702(94)00082-C","volume":"76","author":"B. Nebel","year":"1995","unstructured":"Nebel, B., Koehler, J.: Plan reuse versus plan generation: A theoretical and empirical analysis. Artificial Intelligence\u00a076, 427\u2013454 (1995)","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Declarative Agent Languages and Technologies II"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11493402_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:58:42Z","timestamp":1605625122000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11493402_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540261728","9783540319276"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11493402_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}