{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T10:03:06Z","timestamp":1760608986546,"version":"3.37.3"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,5,2]],"date-time":"2017-05-02T00:00:00Z","timestamp":1493683200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s10489-017-0936-x","type":"journal-article","created":{"date-parts":[[2017,5,2]],"date-time":"2017-05-02T01:34:29Z","timestamp":1493688869000},"page":"914-934","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["LinGraph: a graph-based automated planner for concurrent task planning based on linear logic"],"prefix":"10.1007","volume":"47","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4833-9938","authenticated-orcid":false,"given":"S\u0131tar","family":"Kortik","sequence":"first","affiliation":[]},{"given":"Uluc\u0323","family":"Saranli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,2]]},"reference":[{"key":"936_CR1","first-page":"88","volume-title":"Eighth international planning competition, deterministic part","author":"Y Alkhazraji","year":"2014","unstructured":"Alkhazraji Y, Katz M, Matm\u00fcller R, Pommerening F, Shleyfman A, Wehrle M (2014) Metis: arming fast downward with pruning and incremental computation Eighth international planning competition, deterministic part, pp 88\u201392"},{"issue":"1","key":"936_CR2","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/MRA.2007.339624","volume":"14","author":"C Belta","year":"2007","unstructured":"Belta C, Bicchi A, Egerstedt M, Frazzoli E, Klavins E, Pappas G (2007) Symbolic planning and control of robot motion - grand challenges of robotics. IEEE Robot Autom Mag 14(1):61\u2013 70","journal-title":"IEEE Robot Autom Mag"},{"issue":"1","key":"936_CR3","first-page":"1636","volume":"90","author":"AL Blum","year":"1995","unstructured":"Blum AL, Furst ML (1995) Fast planning through planning graph analysis. Artif Intell 90(1):1636\u20131642","journal-title":"Artif Intell"},{"issue":"1-2","key":"936_CR4","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/S0004-3702(01)00108-4","volume":"129","author":"B Bonet","year":"2001","unstructured":"Bonet B, Geffner H (2001) Planning as heuristic search. Artif Intell 129(1-2):5\u201333","journal-title":"Artif Intell"},{"key":"936_CR5","first-page":"714","volume-title":"Proceedings of the national conference on artificial intelligence","author":"B Bonet","year":"1997","unstructured":"Bonet B, Loerincs G, Geffner H (1997) A robust and fast action selection mechanism for planning Proceedings of the national conference on artificial intelligence, pp 714\u2013719"},{"issue":"1-2","key":"936_CR6","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0004-3702(94)90081-7","volume":"69","author":"T Bylander","year":"1994","unstructured":"Bylander T (1994) The computational complexity of propositional STRIPS planning. Artif Intell 69(1-2):165\u2013204","journal-title":"Artif Intell"},{"issue":"10","key":"936_CR7","doi-asserted-by":"crossref","first-page":"1044","DOI":"10.1016\/j.ic.2008.11.006","volume":"207","author":"I Cervesato","year":"2009","unstructured":"Cervesato I, Scedrov A (2009) Relating state-based and process-based concurrency through linear logic. Inf Comput 207(10):1044\u20131077","journal-title":"Inf Comput"},{"key":"936_CR8","first-page":"26","volume-title":"Proceedings of the international conference on automated planning and scheduling","author":"L Chrpa","year":"2006","unstructured":"Chrpa L (2006) Linear logic in planning Proceedings of the international conference on automated planning and scheduling, pp 26\u201329"},{"issue":"1\u20132","key":"936_CR9","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0004-3702(02)00374-0","volume":"147","author":"A Cimatti","year":"2003","unstructured":"Cimatti A, Pistore M, Roveri M, Traverso P (2003) Weak, strong, and strong cyclic planning via symbolic model checking. Artif Intell 147(1\u20132):35\u201384","journal-title":"Artif Intell"},{"key":"936_CR10","doi-asserted-by":"crossref","unstructured":"Coles A, Coles A, Olaya AG, Jimenez S, Lopez CL, Sanner S, Yoon S (2012) A survey of the seventh international planning competition. AI Mag 33(1)","DOI":"10.1609\/aimag.v33i1.2392"},{"key":"936_CR11","first-page":"252","volume-title":"Recent advances in AI planning, volume 1809 of lecture notes in computer science","author":"S Cresswell","year":"2000","unstructured":"Cresswell S, Smaill A, Richardson J (2000) Deductive synthesis of recursive plans in linear logic. In: Biundo S, Fox M (eds) Recent advances in AI planning, volume 1809 of lecture notes in computer science. Springer, Berlin, pp 252\u2013264"},{"key":"936_CR12","first-page":"1852","volume-title":"Proceedings of the international journal of conference on artificial intelligence","author":"W Cushing","year":"2007","unstructured":"Cushing W, Kambhampati S, Mausam, Weld DS (2007) When is temporal planning really temporal? Proceedings of the international journal of conference on artificial intelligence. Morgan Kaufmann Publishers Inc, San Francisco, CA, USA, pp 1852\u20131859"},{"key":"936_CR13","doi-asserted-by":"crossref","unstructured":"Dimopoulos Y, Nebel B, Koehler J (1997) Encoding planning problems in nonmonotonic logic programs Recent advances in AI planning, vol 1348, pp 169\u2013181","DOI":"10.1007\/3-540-63912-8_84"},{"key":"936_CR14","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s10849-008-9079-0","volume":"18","author":"L Dixon","year":"2009","unstructured":"Dixon L, Smaill A, Tsang T (2009) Plans, actions and dialogue using linear logic. J Log Lang Inf 18:251\u2013289","journal-title":"J Log Lang Inf"},{"key":"936_CR15","volume-title":"Proceedings of the international conference on automated planning and scheduling","author":"C Domshlak","year":"2012","unstructured":"Domshlak C, Katz M, Shleyfman A (2012) Enhanced symmetry breaking in cost-optimal planning as forward search Proceedings of the international conference on automated planning and scheduling"},{"key":"936_CR16","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1613\/jair.1148","volume":"19","author":"T Eiter","year":"2003","unstructured":"Eiter T, Faber W, Leone N, Pfeifer G, Polleres A (2003) Answer set planning under action costs. J Artif Intell Res 19:25\u201371","journal-title":"J Artif Intell Res"},{"key":"936_CR17","first-page":"88","volume-title":"Eighth international planning competition (IPC 2014), deterministic part","author":"P Eyerich","year":"2014","unstructured":"Eyerich P, Keller T, Aldinger J, Dornhege C (2014) Preferring preferred operators in temporal fast downward Eighth international planning competition (IPC 2014), deterministic part, pp 88\u201392"},{"key":"936_CR18","volume-title":"Proceedings of the international conference on automated planning and scheduling","author":"P Eyerich","year":"2009","unstructured":"Eyerich P, Mattm\u00fcller R, R\u00f6ger G (2009) Using the context-enhanced additive heuristic for temporal and numeric planning Proceedings of the international conference on automated planning and scheduling"},{"key":"936_CR19","first-page":"956","volume-title":"Proceedings of the international journal conference on artificial intelligence","author":"M Fox","year":"1999","unstructured":"Fox M, Long D (1999) The detection and exploitation of symmetry in planning problems Proceedings of the international journal conference on artificial intelligence, pp 956\u2013961"},{"key":"936_CR20","unstructured":"Fuentetaja R, de la Rosa T (2015) Compiling irrelevant objects to counters. Special case of creation planning. AI Commun:1\u201333. Preprint"},{"issue":"2","key":"936_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2200\/S00513ED1V01Y201306AIM022","volume":"7","author":"H Geffner","year":"2013","unstructured":"Geffner H, Bonet B (2013) A concise introduction to models and methods for automated planning. Synthesis Lectures on Artificial Intelligence and Machine Learning 7(2):1\u2013141","journal-title":"Synthesis Lectures on Artificial Intelligence and Machine Learning"},{"key":"936_CR22","first-page":"98","volume-title":"Proceedings of the european conference on artificial intelligence","author":"IP Gent","year":"2006","unstructured":"Gent IP, Jefferson C, Miguel I (2006) MINION: a fast, scalable, constraint solver Proceedings of the european conference on artificial intelligence, pp 98\u2013102"},{"issue":"1","key":"936_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J-Y Girard","year":"1987","unstructured":"Girard J-Y (1987) Linear logic. Theor Comput Sci 50(1):1\u2013102","journal-title":"Theor Comput Sci"},{"key":"936_CR24","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s10462-007-9049-y","volume":"26","author":"M Helmert","year":"2006","unstructured":"Helmert M (2006) The fast downward planning system. J Artif Intell Res 26:191\u2013246","journal-title":"J Artif Intell Res"},{"key":"936_CR25","first-page":"140","volume-title":"Proceedings of the international conference on automated planning and scheduling","author":"M Helmert","year":"2008","unstructured":"Helmert M, Geffner H (2008) Unifying the causal graph and additive heuristics Proceedings of the international conference on automated planning and scheduling, pp 140\u2013147"},{"key":"936_CR26","unstructured":"Hickmott SL, Rintanen J, Thi\u00e9baux S, White LB (2007) Planning via petri net unfolding Proceedings of the international joint conference on artificial intelligence, vol 7, pp 1904\u20131911"},{"key":"936_CR27","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1613\/jair.1144","volume":"20","author":"J Hoffmann","year":"2003","unstructured":"Hoffmann J, System Metric-FF Planning (2003) Translating \u201cIgnoring delete lists\u201d to numeric state variables. J Artif Intell Res 20:291\u2013341","journal-title":"J Artif Intell Res"},{"issue":"1","key":"936_CR28","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1613\/jair.855","volume":"14","author":"J Hoffmann","year":"2001","unstructured":"Hoffmann J, Nebel B (2001) The FF planning system: fast plan generation through heuristic search. J Artif Intell Res 14(1):253\u2013302","journal-title":"J Artif Intell Res"},{"key":"936_CR29","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1613\/jair.1492","volume":"22","author":"J Hoffmann","year":"2004","unstructured":"Hoffmann J, Porteous J, Sebastia L (2004) Ordered landmarks in planning. J Artif Intell Res 22:215\u2013278","journal-title":"J Artif Intell Res"},{"key":"936_CR30","volume-title":"Classical AI planning as theorem proving: the case of a fragment of linear logic","author":"E Jacopin","year":"1993","unstructured":"Jacopin E (1993) Classical AI planning as theorem proving: the case of a fragment of linear logic. CA, Palo Alto"},{"issue":"11","key":"936_CR31","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1016\/j.ic.2009.02.008","volume":"207","author":"O Kahramanogullari","year":"2009","unstructured":"Kahramanogullari O (2009) On linear logic planning and concurrency. Inf Comput 207(11):1229\u20131258","journal-title":"Inf Comput"},{"key":"936_CR32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.655","volume":"12","author":"S Kambhampati","year":"2000","unstructured":"Kambhampati S (2000) Planning graph as a: (Dynamic) CSP: exploiting EBL, DDB and other CSP search techniques in GraphPlan. J Artif Intell Res 12:1\u201334","journal-title":"J Artif Intell Res"},{"issue":"6","key":"936_CR33","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1017\/S0960129501003413","volume":"11","author":"M Kanovich","year":"2001","unstructured":"Kanovich M, Vauzeilles J (2001) The classical AI planning problems in the mirror of horn linear logic: semantics, expressibility, complexity. Math Struct Comput Sci 11(6):689\u2013716","journal-title":"Math Struct Comput Sci"},{"issue":"1-2","key":"936_CR34","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.tcs.2007.01.022","volume":"379","author":"M Kanovich","year":"2007","unstructured":"Kanovich M, Vauzeilles J (2007) Strong planning under uncertainty in domains with numerous but identical elements (a generic approach). Theor Comput Sci 379(1-2):84\u2013119","journal-title":"Theor Comput Sci"},{"issue":"1","key":"936_CR35","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0168-0072(94)90011-6","volume":"67","author":"MI Kanovich","year":"1994","unstructured":"Kanovich MI (1994) Linear logic as a logic of computations. Ann Pure Appl Logic 67(1):183\u2013212","journal-title":"Ann Pure Appl Logic"},{"key":"936_CR36","unstructured":"Kautz H, Selman B (1992) Planning as satisfiability Proceedings of the european conference on artificial intelligence. Wiley, pp 359\u2013363"},{"key":"936_CR37","first-page":"58","volume-title":"Proceedings of the AIPS98 workshop on planning as combinatorial search","author":"H Kautz","year":"1998","unstructured":"Kautz H, Selman B (1998) Blackbox: a new approach to the application of theorem proving to problem solving Proceedings of the AIPS98 workshop on planning as combinatorial search, pp 58\u201360"},{"key":"936_CR38","volume-title":"Linear logic for domain-independent AI planning","author":"P Kungas","year":"2003","unstructured":"Kungas P (2003) Linear logic for domain-independent AI planning. Trento, Italy"},{"issue":"1","key":"936_CR39","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0743-1066(96)00121-5","volume":"31","author":"HJ Levesque","year":"1997","unstructured":"Levesque HJ, Reiter R, Lesp\u00e9rance Y, Lin F, Scherl RB (1997) Golog: a logic programming language for dynamic domains. J Log Program 31(1):59\u201383","journal-title":"J Log Program"},{"key":"936_CR40","first-page":"373","volume-title":"Logic programming and nonmonotonic reasoning, volume 1730 of lecture notes in computer science","author":"V Lifschitz","year":"1999","unstructured":"Lifschitz V (1999) Answer set planning. In: Gelfond M, Leone N, Pfeifer G (eds) Logic programming and nonmonotonic reasoning, volume 1730 of lecture notes in computer science. Springer, Berlin, pp 373\u2013374"},{"key":"936_CR41","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/BFb0018359","volume-title":"Category theory and computer science, volume 389 of lecture notes in computer science","author":"N Mart\u00ed-Oliet","year":"1989","unstructured":"Mart\u00ed-Oliet N, Meseguer J (1989) From petri nets to linear logic. In: Pitt DH, Rydeheard DE, Dybjer P, Pitts A, Poigne A (eds) Category theory and computer science, volume 389 of lecture notes in computer science, pp 313\u2013340"},{"issue":"2","key":"936_CR42","doi-asserted-by":"crossref","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 (1993) Generating plans in linear logic I. Actions as proofs. Theor Comput Sci 113(2):349\u2013370","journal-title":"Theor Comput Sci"},{"key":"936_CR43","first-page":"634","volume-title":"Proceedings of the national conference of the american association for artificial intelligence (AAAI-91)","author":"D McAllester","year":"1991","unstructured":"McAllester D, Rosenblitt D (1991) Systematic nonlinear planning Proceedings of the national conference of the american association for artificial intelligence (AAAI-91), pp 634\u2013639"},{"key":"936_CR44","first-page":"463","volume":"4","author":"J McCarthy","year":"1969","unstructured":"McCarthy J (1969) Some philosophical problems from the stand-point of artificial intelligence. Machine Intelligence 4:463\u2013502","journal-title":"Machine Intelligence"},{"key":"936_CR45","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0743-1066(93)90028-F","volume":"17","author":"J Minker","year":"1993","unstructured":"Minker J (1993) An overview of nonmonotonic reasoning and logic programming. J Log Program, Special Issue 17:95\u2013126","journal-title":"J Log Program, Special Issue"},{"issue":"4","key":"936_CR46","first-page":"43","volume":"28","author":"DS Nau","year":"2007","unstructured":"Nau DS (2007) Current trends in automated planning. AI Mag 28(4):43","journal-title":"AI Mag"},{"key":"936_CR47","unstructured":"Pfenning F (2002) Lecture notes on linear logic. Technical report, Carnegie Mellon University"},{"key":"936_CR48","volume-title":"Proceedings of the AAAI conference on artificial intelligence","author":"N Pochter","year":"2011","unstructured":"Pochter N, Rosenschein JS, Zohar A (2011) Exploiting problem symmetries in state-based planners Proceedings of the AAAI conference on artificial intelligence"},{"key":"936_CR49","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1613\/jair.2972","volume":"39","author":"S Richter","year":"2010","unstructured":"Richter S, Westphal M (2010) The LAMA planner: guiding cost-based anytime planning with landmarks. J Artif Intell Res 39:127\u2013177","journal-title":"J Artif Intell Res"},{"key":"936_CR50","first-page":"71","volume-title":"Heuristics and search for domain-independent planning","author":"P Riddle","year":"2015","unstructured":"Riddle P, Barley M, Franco S, Douglas J (2015) Analysis of bagged representations in PDDL Heuristics and search for domain-independent planning, pp 71\u201379"},{"key":"936_CR51","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.artint.2012.08.001","volume":"193","author":"J Rintanen","year":"2012","unstructured":"Rintanen J (2012) Planning as satisfiability: heuristics. Artif Intell 193:45\u201386","journal-title":"Artif Intell"},{"key":"936_CR52","volume-title":"Proceedings of the international conference on automated planning and scheduling","author":"N Robinson","year":"2009","unstructured":"Robinson N, Gretton C, Pham DN, Sattar A (2009) SAT-based parallel planning using a split representation of actions Proceedings of the international conference on automated planning and scheduling"},{"key":"936_CR53","unstructured":"Russel S, Norvig P (1995) Artificial intelligence: a modern approach. Prentice Hall"},{"key":"936_CR54","doi-asserted-by":"crossref","first-page":"3705","DOI":"10.1109\/ROBOT.2007.364046","volume-title":"Proceedings of the IEEE international conference on robotics and automation","author":"U Saranli","year":"2007","unstructured":"Saranli U, Pfenning F (2007) Using constrained intuitionistic linear logic for hybrid robotic planning problems Proceedings of the IEEE international conference on robotics and automation, pp 3705\u20133710"},{"key":"936_CR55","unstructured":"Silva F, Castilho MA, K\u00fcnzle LA (2000) Petriplan: a new algorithm for plan generation Advances in artificial intelligence. Springer, pp 86\u201395"},{"key":"936_CR56","volume-title":"Proceedings of the international conference on automated planning and scheduling","author":"DE Smith","year":"2003","unstructured":"Smith DE (2003) Choosing objectives in over-subscription planning Proceedings of the international conference on automated planning and scheduling"},{"key":"936_CR57","first-page":"105","volume-title":"Eighth international planning competition (IPC 2014), deterministic part","author":"A Torralba","year":"2014","unstructured":"Torralba A, Alcazar V, Borrajo D, Kissmann P, Edelkamp S (2014) Symba: a symbolic bidirectional a planner Eighth international planning competition (IPC 2014), deterministic part, pp 105\u2013108"},{"issue":"6","key":"936_CR58","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1093\/jigpal\/6.6.901","volume":"6","author":"A Tzouvaras","year":"1998","unstructured":"Tzouvaras A (1998) The linear logic of multisets. Log J IGPL 6(6):901\u2013916","journal-title":"Log J IGPL"},{"issue":"3","key":"936_CR59","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/j.artint.2005.08.004","volume":"170","author":"V Vidal","year":"2006","unstructured":"Vidal V, Geffner H (2006) Branching and pruning: an optimal temporal POCL planner based on constraint programming. Artif Intell 170(3):298\u2013335","journal-title":"Artif Intell"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-017-0936-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-017-0936-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-017-0936-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,22]],"date-time":"2019-09-22T14:57:51Z","timestamp":1569164271000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-017-0936-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,2]]},"references-count":59,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["936"],"URL":"https:\/\/doi.org\/10.1007\/s10489-017-0936-x","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2017,5,2]]}}}