{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:07:55Z","timestamp":1743070075688,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540232124"},{"type":"electronic","value":"9783540302100"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30210-0_6","type":"book-chapter","created":{"date-parts":[[2011,1,18]],"date-time":"2011-01-18T10:34:36Z","timestamp":1295346876000},"page":"52-65","source":"Crossref","is-referenced-by-count":0,"title":["Abstraction Within Partial Deduction for Linear Logic"],"prefix":"10.1007","author":[{"given":"Peep","family":"K\u00fcngas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Anderson, J.S., Farley, A.M.: Plan abstraction based on operator generalization. In: Proceedings of the Seventh National Conference on Artificial Intelligence, Saint Paul, MN, pp. 100\u2013104 (1988)"},{"key":"6_CR2","unstructured":"Christensen, J.: Automatic Abstraction in Planning. PhD thesis, Department of Computer Science, Stanford University (1991)"},{"key":"6_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":"6_CR4","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0004-3702(92)90021-O","volume":"57","author":"F. Giunchiglia","year":"1992","unstructured":"Giunchiglia, F., Walsh, T.: A theory of abstraction. Artificial Intelligence\u00a057, 323\u2013389 (1992)","journal-title":"Artificial Intelligence"},{"key":"6_CR5","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":"6_CR6","doi-asserted-by":"crossref","unstructured":"Knoblock, C.A.: An analysis of ABSTRIPS. In: Hendler, J. (ed.) Proceedings of the First International Conference on Artificial Intelligence Planning Systems (AIPS 1992), College Park, Maryland, June 15-17, pp. 126\u2013135 (1992)","DOI":"10.1016\/B978-0-08-049944-4.50020-3"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0004-3702(94)90069-8","volume":"68","author":"C.A. Knoblock","year":"1994","unstructured":"Knoblock, C.A.: Automatically generating abstractions for planning. Artificial Intelligence\u00a068, 243\u2013302 (1994)","journal-title":"Artificial Intelligence"},{"key":"6_CR8","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":"6_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0004-3702(87)90051-8","volume":"33","author":"R.E. Korf","year":"1987","unstructured":"Korf, R.E.: Planning as search: A quantitative approach. Artificial Intelligence\u00a033, 65\u201388 (1987)","journal-title":"Artificial Intelligence"},{"key":"6_CR10","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":"6_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/11493402_3","volume-title":"Declarative Agent Languages and Technologies II","author":"P. K\u00fcngas","year":"2005","unstructured":"K\u00fcngas, P., Matskin, M.: Partial deduction for linear logic \u2013 the symbolic negotiation perspective. In: Leite, J., Omicini, A., Torroni, P., Yolum, p. (eds.) DALT 2004. LNCS (LNAI), vol.\u00a03476, pp. 35\u201352. Springer, Heidelberg (2005)"},{"key":"6_CR12","unstructured":"Levy, A.Y.: Creating abstractions using relevance reasoning. In: Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI 1994), pp. 588\u2013594 (1994)"},{"key":"6_CR13","volume-title":"Human Problem Solving","author":"A. Newell","year":"1972","unstructured":"Newell, A., Simon, H.A.: Human Problem Solving. Prentice-Hall, Englewood Cliffs (1972)"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0004-3702(81)90015-1","volume":"16","author":"D.A. Plaisted","year":"1981","unstructured":"Plaisted, D.A.: Theorem proving with abstraction. Artificial Intelligence\u00a016, 47\u2013108 (1981)","journal-title":"Artificial Intelligence"},{"key":"6_CR15","unstructured":"Ruby, D., Kibler, D.: Learning subgoal sequences for planning. In: Proceedings of the Eleventh International Joint Conference on Artificial Intelligence (IJCAI 1989), Detroit, Michigan, USA, August 20-25, vol.\u00a01, pp. 609\u2013614 (1989)"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0004-3702(74)90026-5","volume":"5","author":"E.D. Sacerdoti","year":"1974","unstructured":"Sacerdoti, E.D.: Planning in a hierarchy of abstraction spaces. Artificial Intelligence\u00a05, 115\u2013135 (1974)","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30210-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T00:20:38Z","timestamp":1675729238000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-30210-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232124","9783540302100"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30210-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}