{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:47:01Z","timestamp":1725558421842},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540408017"},{"type":"electronic","value":"9783540452201"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45220-1_24","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T19:33:58Z","timestamp":1277494438000},"page":"285-298","source":"Crossref","is-referenced-by-count":1,"title":["Coping Polynomially with Numerous but Identical Elements within Planning Problems"],"prefix":"10.1007","author":[{"given":"Max","family":"Kanovich","sequence":"first","affiliation":[]},{"given":"Jacqueline","family":"Vauzeilles","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"AIPS 1998, Planning Systems Competition, http:\/\/www.informatik.uni-freiburg.de\/~koehler\/aips.html"},{"key":"24_CR2","unstructured":"AIPS-00 Planning Competition, http:\/\/www.cs.toronto.edu\/aips2000\/"},{"key":"24_CR3","unstructured":"Proceedings of SAT-2002, Fifth International Symposium on the Theory and Applications of Satisfiability Testing, Cincinnati, Ohio, USA, May 6-9 (2002)"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF03037438","volume":"4","author":"W. Bibel","year":"1986","unstructured":"Bibel, W.: A deductive Solution for Plan Generation. New Generation Computing\u00a04, 115\u2013132 (1986)","journal-title":"New Generation Computing"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0004-3702(94)90081-7","volume":"69","author":"T. Bylander","year":"1994","unstructured":"Bylander, T.: The Computational Complexity of Propositional STRIPS Planning. Artificial Intelligence\u00a069, 165\u2013204 (1994)","journal-title":"Artificial Intelligence"},{"key":"24_CR6","unstructured":"Bylander, T.: A Linear Programming Heuristic for Optimal Planning. In: Proceedings of the Fourteenth National Conference on Artificial Intelligence, pp. 694\u2013699 (1997)"},{"key":"24_CR7","unstructured":"Erol, K., Nau, D., Hendler, J.: A Critical Look at Critics in HTN Planning. In: IJCAI-1995, Montreal (August 1995)"},{"key":"24_CR8","first-page":"1","volume":"76","author":"K. Erol","year":"1995","unstructured":"Erol, K., Nau, D., Subrahmanian, V.S.: Complexity, Decidability and Undecidability Results for Domain-Independent Planning. Artificial Intelligence; Special Issue on Planning 76, 1-2 (July 1995)","journal-title":"Artificial Intelligence; Special Issue on Planning"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(95)00034-C","volume":"76","author":"D. McDermott","year":"1995","unstructured":"McDermott, D., Hendler, J.: Planning: What it is, What it could be. An introduction to the Special Issue on Planning and Scheduling. Artificial Intelligence\u00a076, 1\u201316 (1995)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"24_CR10","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), 1\u2013102 (1987)","journal-title":"Theoretical Computer Science"},{"key":"24_CR11","series-title":"London Mathematical Society Lecture Notes","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/CBO9780511629150.002","volume-title":"Advances in Linear Logic","author":"J.-Y. Girard","year":"1995","unstructured":"Girard, J.-Y.: Linear logic: its syntax and semantics. In: Girard, J.-Y., Lafont, Y., Regnier, L. (eds.) Advances in Linear Logic. London Mathematical Society Lecture Notes, vol.\u00a0222, pp. 1\u201342. Cambridge University Press, Cambridge (1995)"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0168-0072(94)90011-6","volume":"67","author":"M. Kanovich","year":"1994","unstructured":"Kanovich, M.: 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":"24_CR13","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1017\/S0960129501003413","volume":"11","author":"M. Kanovich","year":"2001","unstructured":"Kanovich, M., Vauzeilles, J.: The Classical AI Planning Problems in the Mirror of Horn Linear Logic: Semantics, Expressibility, Complexity. Journal of Mathematical Structures in Computer Science\u00a011, 689\u2013716 (2001)","journal-title":"Journal of Mathematical Structures in Computer Science"},{"key":"24_CR14","unstructured":"Kautz, H., Selman, B.: Pushing the envelope: planning, propositional logic, and stochastic search. In: Proc. AAAI-1996, Portland, OR (1996)"},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0004-3702(86)90032-9","volume":"28","author":"J. McCarthy","year":"1986","unstructured":"McCarthy, J.: Applications of circumscription to formalizing common-sense knowledge. Artificial Intelligence\u00a028, 89\u2013116 (1986)","journal-title":"Artificial Intelligence"},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/0304-3975(93)90007-G","volume":"113","author":"M. Masseron","year":"1993","unstructured":"Masseron, M., Tollu, C., Vauzeilles, J.: Generating Plans in Linear Logic: I. Actions as proofs. Theoretical Computer Science\u00a0113, 349\u2013370 (1993)","journal-title":"Theoretical Computer Science"},{"key":"24_CR17","volume-title":"Artificial Intelligence: A New Synthesis","author":"N.J. Nilsson","year":"1998","unstructured":"Nilsson, N.J.: Artificial Intelligence: A New Synthesis. Morgan Kaufmann, San Francisco (1998)"},{"key":"24_CR18","unstructured":"Scedrov, A.: Linear logic and computation: a survey. In: Schwichtenberg, H. (ed.) Proof and Computation, Proc. Marktoberdorf Summer School 1993, pp. 281\u2013298. NATO Advanced Science Institutes, Berlin (1993)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45220-1_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T09:01:33Z","timestamp":1559206893000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45220-1_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540408017","9783540452201"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45220-1_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}