{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T00:10:01Z","timestamp":1748391001544,"version":"3.41.0"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319196855"},{"type":"electronic","value":"9783319196862"}],"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-19686-2_2","type":"book-chapter","created":{"date-parts":[[2015,5,13]],"date-time":"2015-05-13T16:45:12Z","timestamp":1431535512000},"page":"17-33","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["State Space Planning Using Transaction Logic"],"prefix":"10.1007","author":[{"given":"Reza","family":"Basseda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kifer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,14]]},"reference":[{"key":"2_CR1","unstructured":"Bacchus, F.: AIPS-00 planning competition, May 2000. http:\/\/www.cs.toronto.edu\/aips2000"},{"issue":"2","key":"2_CR2","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":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-642-45111-9_40","volume-title":"Advances in Soft Computing and Its Applications","author":"R Bart\u00e1k","year":"2013","unstructured":"Bart\u00e1k, R., Zhou, N.-F.: On modeling planning problems: experience from the petrobras challenge. In: Castro, F., Gelbukh, A., Gonz\u00e1lez, M. (eds.) MICAI 2013, Part II. LNCS, vol. 8266, pp. 466\u2013477. Springer, Heidelberg (2013). http:\/\/dx.doi.org\/10.1007\/978-3-642-45111-9_40"},{"issue":"4\u20135","key":"2_CR4","first-page":"697","volume":"14","author":"R Bart\u00e1k","year":"2014","unstructured":"Bart\u00e1k, R., Zhou, N.: Using tabled logic programming to solve the petrobras planning problem. TPLP 14(4\u20135), 697\u2013710 (2014). http:\/\/dx.doi.org\/10.1017\/S1471068414000295","journal-title":"TPLP"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"2_CR6","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 4(2), 115\u2013132 (1986)","journal-title":"New Generation Computing"},{"key":"2_CR7","series-title":"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. Information Systems, pp. 453\u2013473. Springer, Heidelberg (1989)"},{"key":"2_CR8","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, Informatik-Fachberichte","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, Heidelberg (1989)"},{"key":"2_CR9","unstructured":"Bonner, A., Kifer, M.: Transaction logic programming. In: Int\u2019l Conference on Logic Programming, pp. 257\u2013282. MIT Press, Budapest, June 1993"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BFb0013981","volume-title":"Temporal Logic","author":"AJ Bonner","year":"1994","unstructured":"Bonner, A.J., Kifer, M.: Applications of transaction logic to knowledge representation. In: Gabbay, D.M., Ohlbach, H.J. (eds.) ICTL1994. LNCS, vol. 827, pp. 67\u201381. Springer, Heidelberg (1994)"},{"key":"2_CR11","unstructured":"Bonner, A., Kifer, M.: Transaction logic programming (or a logic of declarative and procedural knowledge). Tech. Rep. CSRI-323, University of Toronto, November 1995. http:\/\/www.cs.toronto.edu\/~bonner\/transaction-logic.html"},{"key":"2_CR12","unstructured":"Bonner, A., Kifer, M.: Concurrency and communication in transaction logic. In: Joint Int\u2019l Conference and Symposium on Logic Programming, pp. 142\u2013156. MIT Press, Bonn, September 1996"},{"key":"2_CR13","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, ch. 5, pp. 117\u2013166. Kluwer Academic Publishers, March 1998","DOI":"10.1007\/978-1-4615-5643-5_5"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Bonner, A.J., Kifer, M.: An overview of transaction logic. Theoretical Computer Science 133 (1994)","DOI":"10.1016\/0304-3975(94)90190-2"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","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. Lecture Notes in Computer Science, vol. 1809, pp. 252\u2013264. Springer, Heidelberg (2000)"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-20832-4_17","volume-title":"Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning","author":"A Dovier","year":"2011","unstructured":"Dovier, A., Formisano, A., Pontelli, E.: Perspectives on logic-based approaches for reasoning about actions and change. In: Balduccini, M., Son, T.C. (eds.) Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning. LNCS, vol. 6565, pp. 259\u2013279. Springer, Heidelberg (2011). http:\/\/dx.doi.org\/10.1007\/978-3-642-20832-4_17"},{"key":"2_CR17","unstructured":"Ernst, M.D., Millstein, T.D., Weld, D.S.: Automatic sat-compilation of planning problems. In: Proceedings of the Fifteenth International Joint Conference on Artifical Intelligence, IJCAI 1997, vol. 2, pp. 1169\u20131176. Morgan Kaufmann Publishers Inc., San Francisco (1997). http:\/\/dl.acm.org\/citation.cfm?id=1622270.1622325"},{"key":"2_CR18","first-page":"249","volume-title":"Proceedings of the Second International Conference on Artificial Intelligence Planning Systems","author":"K Erol","year":"1994","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.) AAAI 1994, pp. 249\u2013254. University of Chicago, Chicago (1994). http:\/\/www.aaai.org\/Library\/AIPS\/1994\/aips94-042.php"},{"issue":"34","key":"2_CR19","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. Artificial Intelligence 2(34), 189\u2013208 (1971)","journal-title":"Artificial Intelligence"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Fodor, P., Kifer, M.: Tabling for transaction logic. In: Proceedings of the 12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, PPDP 2010, pp. 199\u2013208. ACM, New York (2010)","DOI":"10.1145\/1836089.1836115"},{"key":"2_CR21","unstructured":"Fodor, P., Kifer, M.: Transaction logic with defaults and argumentation theories. In: Gallagher, J.P., Gelfond, M. (eds.) Technical Communications of the 27th International Conference on Logic Programming, ICLP 2011, July 6\u201310, 2011, Lexington, Kentucky, USA. LIPIcs, vol. 11, pp. 162\u2013174. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011). http:\/\/dx.doi.org\/10.4230\/LIPIcs.ICLP.2011.162"},{"issue":"1","key":"2_CR22","first-page":"61","volume":"20","author":"M Fox","year":"2003","unstructured":"Fox, M., Long, D.: Pddl2.1: An extension to pddl for expressing temporal planning domains. J. Artif. Int. Res. 20(1), 61\u2013124 (2003). http:\/\/dl.acm.org\/citation.cfm?id=1622452.1622454","journal-title":"J. Artif. Int. Res."},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-642-20895-9_41","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Gebser","year":"2011","unstructured":"Gebser, M., Kaminski, R., Knecht, M., Schaub, T.: plasp: A prototype for PDDL-based planning in ASP. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol. 6645, pp. 358\u2013363. Springer, Heidelberg (2011)"},{"key":"2_CR24","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"},{"issue":"1","key":"2_CR25","first-page":"139","volume":"20","author":"H Geffner","year":"2003","unstructured":"Geffner, H.: Pddl 2.1: Representation vs. computation. J. Artif. Int. Res. 20(1), 139\u2013144 (2003). http:\/\/dl.acm.org\/citation.cfm?id=1622452.1622457","journal-title":"J. Artif. Int. Res."},{"key":"2_CR26","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":"Artif. Intell."},{"issue":"5\u20136","key":"2_CR27","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1016\/j.artint.2008.10.012","volume":"173","author":"A Gerevini","year":"2009","unstructured":"Gerevini, A., Haslum, P., Long, D., Saetti, A., Dimopoulos, Y.: Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners. Artif. Intell. 173(5\u20136), 619\u2013668 (2009). http:\/\/dx.doi.org\/10.1016\/j.artint.2008.10.012","journal-title":"Artif. Intell."},{"key":"2_CR28","unstructured":"Ghallab, M., Isi, C.K., Penberthy, S., Smith, D.E., Sun, Y., Weld, D.: PDDL - The Planning Domain Definition Language. Tech. rep., CVC TR-98-003\/DCS TR-1165, Yale Center for Computational Vision and Control (1998). http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.37.212"},{"key":"2_CR29","unstructured":"Giunchiglia, E., Massarotto, A., Sebastiani, R.: Act, and the rest will follow: exploiting determinism in planning as satisfiability. In: Proceedings of the Fifteenth National\/Tenth Conference on Artificial Intelligence\/Innovative Applications of Artificial Intelligence, AAAI 1998\/IAAI 1998, pp. 948\u2013953. American Association for Artificial Intelligence, Menlo Park (1998). http:\/\/dl.acm.org\/citation.cfm?id=295240.295931"},{"key":"2_CR30","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 (1969). http:\/\/dl.acm.org\/citation.cfm?id=1624562.1624585"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Gregory, P., Long, D., Fox, M.: Constraint based planning with composable substate graphs. In: Coelho, H., Studer, R., Wooldridge, M. (eds.) Proceedings of ECAI 2010\u201319th European Conference on Artificial Intelligence, Lisbon, Portugal, August 16\u201320, 2010. Frontiers in Artificial Intelligence and Applications, vol. 215, pp. 453\u2013458. IOS Press (2010). http:\/\/dx.doi.org\/10.3233\/978-1-60750-606-5-453","DOI":"10.3233\/978-1-60750-606-5-453"},{"issue":"3","key":"2_CR32","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 Generation Computing 8(3), 225\u2013244 (1990)","journal-title":"New Generation Computing"},{"key":"2_CR33","unstructured":"Kahramanogullari, O.: Towards planning as concurrency. In: Hamza, M.H. (ed.) Artificial Intelligence and Applications, pp. 387\u2013393. IASTED\/ACTA Press (2005)"},{"issue":"11","key":"2_CR34","doi-asserted-by":"publisher","first-page":"1229","DOI":"10.1016\/j.ic.2009.02.008","volume":"207","author":"O Kahramanogullari","year":"2009","unstructured":"Kahramanogullari, O.: On linear logic planning and concurrency. Information and Computation 207(11), 1229\u20131258 (2009). special Issue: 2nd International Conference on Language and Automata Theory and Applications (LATA 2008)","journal-title":"Information and Computation"},{"key":"2_CR35","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 (1992). http:\/\/dl.acm.org\/citation.cfm?id=145448.146725"},{"issue":"12","key":"2_CR36","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. Artificial Intelligence 138(12), 39\u201354 (2002). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0004370202001868. knowledge Representation and Logic Programming","journal-title":"Artificial Intelligence"},{"issue":"2","key":"2_CR37","first-page":"35","volume":"21","author":"DV McDermott","year":"2000","unstructured":"McDermott, D.V.: The 1998 AI planning systems competition. AI Magazine 21(2), 35\u201355 (2000). http:\/\/www.aaai.org\/ojs\/index.php\/aimagazine\/article\/view\/1506","journal-title":"AI Magazine"},{"key":"2_CR38","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1613\/jair.1996","volume":"20","author":"DV McDermott","year":"2003","unstructured":"McDermott, D.V.: PDDL2.1 - the art of the possible? commentary on fox and long. J. Artif. Intell. Res. (JAIR) 20, 145\u2013148 (2003). http:\/\/dx.doi.org\/10.1613\/jair.1996","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"2_CR39","volume-title":"Automated Planning: Theory & Practice","author":"D Nau","year":"2004","unstructured":"Nau, D., Ghallab, M., Traverso, P.: Automated Planning: Theory & Practice. Morgan Kaufmann Publishers Inc., San Francisco (2004)"},{"key":"2_CR40","volume-title":"Principles of Artificial Intelligence","author":"N Nilsson","year":"1980","unstructured":"Nilsson, N.: Principles of Artificial Intelligence. Tioga Publ. Co., Paolo Alto (1980)"},{"key":"2_CR41","unstructured":"Pednault, E.P.D.: Adl: Exploring the middle ground between strips and the situation calculus. In: Proceedings of the First International Conference on Principles of Knowledge Representation and Reasoning, pp. 324\u2013332. Morgan Kaufmann Publishers Inc., San Francisco (1989). http:\/\/dl.acm.org\/citation.cfm?id=112922.112954"},{"issue":"2","key":"2_CR42","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s13740-012-0007-8","volume":"1","author":"M Rezk","year":"2012","unstructured":"Rezk, M., Kifer, M.: Transaction logic with partially defined actions. J. Data Semantics 1(2), 99\u2013131 (2012)","journal-title":"J. Data Semantics"},{"key":"2_CR43","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1613\/jair.1997","volume":"20","author":"DE Smith","year":"2003","unstructured":"Smith, D.E.: The case for durative actions: A commentary on PDDL2.1. J. Artif. Intell. Res. (JAIR) 20, 149\u2013154 (2003). http:\/\/dx.doi.org\/10.1613\/jair.1997","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"issue":"4","key":"2_CR44","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":"2_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-02846-5_13","volume-title":"Logic Programming","author":"TC Son","year":"2009","unstructured":"Son, T.C., Pontelli, E., Sakama, C.: Logic programming for multiagent planning with negotiation. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol. 5649, pp. 99\u2013114. Springer, Heidelberg (2009). http:\/\/dx.doi.org\/10.1007\/978-3-642-02846-5_13"},{"key":"2_CR46","doi-asserted-by":"crossref","unstructured":"Srivastava, S., Immerman, N., Zilberstein, S., Zhang, T.: Directed search for generalized plans using classical planners. In: Proceedings of the 21st International Conference on Automated Planning and Scheduling (ICAPS-2011). AAAI, June 2011","DOI":"10.1609\/icaps.v21i1.13475"},{"key":"2_CR47","unstructured":"Stefik, M.J.: Planning with Constraints. Ph.D. thesis, Stanford, CA, USA (1980). aAI8016868"},{"key":"2_CR48","doi-asserted-by":"crossref","unstructured":"Zhou, N., Dovier, A.: A tabled prolog program for solving sokoban. In: IEEE 23rd International Conference on Tools with Artificial Intelligence, ICTAI 2011, Boca Raton, FL, USA, November 7\u20139, 2011, pp. 896\u2013897. IEEE Computer Society (2011). http:\/\/dx.doi.org\/10.1109\/ICTAI.2011.145","DOI":"10.1109\/ICTAI.2011.145"},{"issue":"4","key":"2_CR49","doi-asserted-by":"crossref","first-page":"561","DOI":"10.3233\/FI-2013-849","volume":"124","author":"N Zhou","year":"2013","unstructured":"Zhou, N., Dovier, A.: A tabled prolog program for solving sokoban. Fundam. Inform. 124(4), 561\u2013575 (2013). http:\/\/dx.doi.org\/10.3233\/FI-2013-849","journal-title":"Fundam. Inform."}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19686-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T23:38:14Z","timestamp":1748389094000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19686-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319196855","9783319196862"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19686-2_2","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":"14 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}