{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T16:40:01Z","timestamp":1748623201475,"version":"3.41.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319232638"},{"type":"electronic","value":"9783319232645"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23264-5_45","type":"book-chapter","created":{"date-parts":[[2015,9,14]],"date-time":"2015-09-14T06:29:48Z","timestamp":1442212188000},"page":"545-551","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Doctoral Consortium Extended Abstract: Planning with Concurrent Transaction Logic"],"prefix":"10.1007","author":[{"given":"Reza","family":"Basseda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,15]]},"reference":[{"issue":"2","key":"45_CR1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.3233\/FI-2010-242","volume":"99","author":"R Bart\u00e1k","year":"2010","unstructured":"Bart\u00e1k, R., Toropila, D.: Solving sequential planning problems via constraint satisfaction. Fundam. Inform. 99(2), 125\u2013145 (2010). http:\/\/dx.doi.org\/10.3233\/FI-2010-242","journal-title":"Fundam. Inform."},{"key":"45_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-319-19686-2_2","volume-title":"Practical Aspects of Declarative Languages","author":"R Basseda","year":"2015","unstructured":"Basseda, R., Kifer, M.: State space planning using transaction logic. In: Pontelli, E., Son, T.C. (eds.) PADL 2015. LNCS, vol. 9131, pp. 17\u201333. Springer, Heidelberg (2015)"},{"key":"45_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-319-22002-4_5","volume-title":"Web Reasoning and Rule Systems","author":"R Basseda","year":"2015","unstructured":"Basseda, R., Kifer, M.: Planning with regression analysis in transaction logic. In: ten Cate, B., Mileo, A. (eds.) RR 2015. LNCS, vol. 9209, pp. 45\u201360. Springer, Heidelberg (2015)"},{"key":"45_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/978-3-319-11113-1_3","volume-title":"Web Reasoning and Rule Systems","author":"R Basseda","year":"2014","unstructured":"Basseda, R., Kifer, M., Bonner, A.J.: Planning with transaction logic. In: Kontchakov, R., Mugnier, M.-L. (eds.) RR 2014. LNCS, vol. 8741, pp. 29\u201344. Springer, Heidelberg (2014)"},{"issue":"2","key":"45_CR5","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 Gener. Comput. 4(2), 115\u2013132 (1986)","journal-title":"New Gener. Comput."},{"key":"45_CR6","series-title":"Topics in Information Systems","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/978-3-642-83397-7_21","volume-title":"Foundations of Knowledge Base Management","author":"W Bibel","year":"1989","unstructured":"Bibel, W.: A deductive solution for plan generation. In: Schmidt, J.W., Thanos, C. (eds.) Foundations of Knowledge Base Management. Topics in Information Systems, pp. 453\u2013473. Springer, Heidelberg (1989)"},{"key":"45_CR7","series-title":"Informatik-Fachberichte","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-75100-4_7","volume-title":"GWAI-89 13th German Workshop on Artificial Intelligence","author":"W Bibel","year":"1989","unstructured":"Bibel, W., del Cerro, L.F., Fronhfer, B., Herzig, A.: Plan generation by linear proofs: on semantics. In: Metzing, D. (ed.) GWAI-89 13th German Workshop on Artificial Intelligence. Informatik-Fachberichte, vol. 216, pp. 49\u201362. Springer, Berlin Heidelberg (1989)"},{"key":"45_CR8","unstructured":"Bonner, A., Kifer, M.: Transaction logic programming. In: International Conference on Logic Programming, pp. 257\u2013282. MIT Press, Budapest, Hungary, June 1993"},{"key":"45_CR9","unstructured":"Bonner, A., Kifer, M.: Transaction logic programming (or a logic of declarative and procedural knowledge). Technical report CSRI-323, University of Toronto, November 1995. http:\/\/www.cs.toronto.edu\/~bonner\/transaction-logic.html"},{"key":"45_CR10","unstructured":"Bonner, A., Kifer, M.: Concurrency and communication in transaction logic. In: Joint International Conference and Symposium on Logic Programming, pp. 142\u2013156. MIT Press, Bonn, Germany, September 1996"},{"key":"45_CR11","doi-asserted-by":"crossref","unstructured":"Bonner, A., Kifer, M.: A logic for programming database transactions. In: Chomicki, J., Saake, G. (eds.) Logics for Databases and Information Systems, chap. 5, pp. 117\u2013166. Kluwer Academic Publishers, March 1998","DOI":"10.1007\/978-1-4615-5643-5_5"},{"issue":"2","key":"45_CR12","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0304-3975(94)90190-2","volume":"133","author":"AJ Bonner","year":"1994","unstructured":"Bonner, A.J., Kifer, M.: An overview of transaction logic. Theor. Comput. Sci. 133(2), 205\u2013265 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"45_CR13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/10720246_20","volume-title":"Recent Advances in AI Planning","author":"S Cresswell","year":"2000","unstructured":"Cresswell, S., Smaill, A., Richardson, J.: Deductive synthesis of recursive plans in linear logic. In: Biundo, S., Fox, M. (eds.) Recent Advances in AI Planning. LNCS, vol. 1809, pp. 252\u2013264. Springer, Berlin Heidelberg (2000)"},{"key":"45_CR14","unstructured":"Erol, K., Hendler, J.A., Nau, D.S.: UMCP: a sound and complete procedure for hierarchical task-network planning. In: Hammond, K.J. (ed.) Proceedings of the Second International Conference on Artificial Intelligence Planning Systems, University of Chicago, Chicago, Illinois, USA, 13\u201315 June 1994, pp. 249\u2013254. AAAI (1994). http:\/\/www.aaai.org\/Library\/AIPS\/1994\/aips94-042.php"},{"issue":"3\u20134","key":"45_CR15","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0004-3702(71)90010-5","volume":"2","author":"RE Fikes","year":"1971","unstructured":"Fikes, R.E., Nilsson, N.J.: STRIPS: a new approach to the application of theorem proving to problem solving. Artif. Intell. 2(3\u20134), 189\u2013208 (1971)","journal-title":"Artif. Intell."},{"key":"45_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-30743-0_20","volume-title":"Correct Reasoning","author":"M Gebser","year":"2012","unstructured":"Gebser, M., Kaufmann, R., Schaub, T.: Gearing up for effective ASP planning. In: Erdem, E., Lee, J., Lierler, Y., Pearce, D. (eds.) Correct Reasoning. LNCS, vol. 7265, pp. 296\u2013310. Springer, Heidelberg (2012). http:\/\/dl.acm.org\/citation.cfm?id=2363344.2363364"},{"key":"45_CR17","first-page":"193","volume":"2","author":"M Gelfond","year":"1998","unstructured":"Gelfond, M., Lifschitz, V.: Action languages. Electron. Trans. Artif. Intell. 2, 193\u2013210 (1998). http:\/\/www.ep.liu.se\/ej\/etai\/1998\/007\/","journal-title":"Electron. Trans. Artif. Intell."},{"key":"45_CR18","unstructured":"Green, C.: Application of theorem proving to problem solving. In: Proceedings of the 1st International Joint Conference on Artificial Intelligence, IJCAI 1969, pp. 219\u2013239. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (1969). http:\/\/dl.acm.org\/citation.cfm?id=1624562.1624585"},{"issue":"3","key":"45_CR19","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF03037518","volume":"8","author":"S H\u00f6lldobler","year":"1990","unstructured":"H\u00f6lldobler, S., Schneeberger, J.: A new deductive approach to planning. New Gener. Comput. 8(3), 225\u2013244 (1990)","journal-title":"New Gener. Comput."},{"key":"45_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-540-88282-4_24","volume-title":"Language and Automata Theory and Applications","author":"O Kahramano\u011fullar\u0131","year":"2008","unstructured":"Kahramano\u011fullar\u0131, O.: On linear logic planning and concurrency. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 250\u2013262. Springer, Heidelberg (2008)"},{"key":"45_CR21","unstructured":"Kautz, H., Selman, B.: Planning as satisfiability. In: Proceedings of the 10th European Conference on Artificial Intelligence, ECAI 1992, pp. 359\u2013363. John Wiley & Sons Inc, New York, USA (1992). http:\/\/dl.acm.org\/citation.cfm?id=145448.146725"},{"issue":"12","key":"45_CR22","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0004-3702(02)00186-8","volume":"138","author":"V Lifschitz","year":"2002","unstructured":"Lifschitz, V.: Answer set programming and plan generation. Artif. Intell. 138(12), 39\u201354 (2002). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0004370202001868, knowledge Representation and Logic Programming","journal-title":"Artif. Intell."},{"issue":"4","key":"45_CR23","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1145\/1183278.1183279","volume":"7","author":"TC Son","year":"2006","unstructured":"Son, T.C., Baral, C., Tran, N., Mcilraith, S.: Domain-dependent knowledge in answer set planning. ACM Trans. Comput. Logic 7(4), 613\u2013657 (2006). http:\/\/doi.acm.org\/10.1145\/1183278.1183279","journal-title":"ACM Trans. Comput. Logic"},{"key":"45_CR24","unstructured":"Stefik, M.J.: Planning with Constraints. Ph.D. thesis, Stanford, CA, USA (1980), aAI8016868"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23264-5_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T16:22:11Z","timestamp":1748622131000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23264-5_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319232638","9783319232645"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23264-5_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"15 September 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}