{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T11:07:21Z","timestamp":1767092841869},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"22","license":[{"start":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T00:00:00Z","timestamp":1649203200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T00:00:00Z","timestamp":1649203200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s00500-022-07044-5","type":"journal-article","created":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T05:02:59Z","timestamp":1649221379000},"page":"12217-12234","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Using deep learning techniques for solving AI planning problems specified through graph transformations"],"prefix":"10.1007","volume":"26","author":[{"given":"Einollah","family":"Pira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,6]]},"reference":[{"key":"7044_CR1","unstructured":"Aeronautiques C, Howe A, Knoblock C, McDermott ID, Ram A, Veloso M, Weld D, Sri DW, Barrett A, Christianson D (1998) PDDL | the planning domain definition language"},{"key":"7044_CR2","unstructured":"Alsmadi M, Omar KB, Noah SA (2009) Back propagation algorithm: the best algorithm among the multi-layer perceptron algorithm"},{"key":"7044_CR3","first-page":"5360","volume":"30","author":"T Anthony","year":"2017","unstructured":"Anthony T, Tian Z, Barber D (2017) Thinking fast and slow with deep learning and tree search. Adv Neural Inf Process Syst 30:5360\u20135370","journal-title":"Adv Neural Inf Process Syst"},{"key":"7044_CR4","doi-asserted-by":"crossref","unstructured":"Arcuri A, Briand L (2011) A practical guide for using statistical tests to assess randomized algorithms in software engineering. In: 2011 33rd international conference on software engineering (ICSE), 1\u201310","DOI":"10.1145\/1985793.1985795"},{"key":"7044_CR5","first-page":"3642","volume":"2012","author":"D Ciregan","year":"2012","unstructured":"Ciregan D, Meier U, Schmidhuber J (2012) Multi-column deep neural networks for image classification. IEEE Conf Comput vis Pattern Recognit 2012:3642\u20133649","journal-title":"IEEE Conf Comput vis Pattern Recognit"},{"issue":"3\u20134","key":"7044_CR6","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1561\/2000000039","volume":"7","author":"L Deng","year":"2014","unstructured":"Deng L, Yu D (2014) Deep learning: methods and applications. Found Trends Signal Process 7(3\u20134):197\u2013387","journal-title":"Found Trends Signal Process"},{"key":"7044_CR7","unstructured":"Deus J (2019) Going deep from scratch. https:\/\/medium.com\/@jeraldydeus\/going-deep-from-scratch-3809f5890c5e. Accessed 9 Aug 2019"},{"key":"7044_CR8","unstructured":"Edelkamp S, Rensink A (2007) Graph transformation and AI planning. Knowledge engineering competition (ICKEPS), Rhode Island"},{"key":"7044_CR9","doi-asserted-by":"crossref","unstructured":"Edelkamp S, Jabbar S, Lafuente AL (2006) Heuristic search for the analysis of graph transition systems. International conference on graph transformation.  Springer, Berlin, Heidelberg, pp 414\u2013429","DOI":"10.1007\/11841883_29"},{"key":"7044_CR10","volume-title":"Deep learning","author":"I Goodfellow","year":"2016","unstructured":"Goodfellow I, Bengio Y, Courville A (2016) Deep learning. MIT Press, Cambridge"},{"key":"7044_CR11","doi-asserted-by":"crossref","unstructured":"Hiramath CK, Deshpande GC (2019) Fake news detection using deep learning techniques. In: 1st International conference on advances in information technology (ICAIT). IEEE, pp 411\u2013415","DOI":"10.1109\/ICAIT47043.2019.8987258"},{"key":"7044_CR12","doi-asserted-by":"publisher","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:253\u2013302","journal-title":"J Artif Intell Res"},{"issue":"2","key":"7044_CR13","doi-asserted-by":"publisher","first-page":"149","DOI":"10.14311\/NNW.2018.28.009","volume":"28","author":"JP Huang","year":"2018","unstructured":"Huang JP, Wang XA, Zhao Y, Xin C, Xiang H (2018) Large earthquake magnitude prediction in Taiwan based on deep learning neural network. Neural Netw World 28(2):149\u2013160","journal-title":"Neural Netw World"},{"issue":"8","key":"7044_CR14","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","volume":"31","author":"AK Jain","year":"2010","unstructured":"Jain AK (2010) Data clustering: 50 years beyond K-means. Pattern Recogn Lett 31(8):651\u2013666","journal-title":"Pattern Recogn Lett"},{"key":"7044_CR15","doi-asserted-by":"crossref","unstructured":"Kastenberg H, Rensink A (2006) Model checking dynamic states in GROOVE. In: International SPIN workshop on model checking of software. Springer, Berlin, Heidelberg, pp 299\u2013305","DOI":"10.1007\/11691617_19"},{"issue":"9","key":"7044_CR16","doi-asserted-by":"publisher","first-page":"1341","DOI":"10.1109\/TNN.2011.2162110","volume":"22","author":"A Khosravi","year":"2011","unstructured":"Khosravi A, Nahavandi S, Creighton D, Atiya AF (2011) Comprehensive review of neural network-based prediction intervals and new advances. IEEE Trans Neural Netw 22(9):1341\u20131356","journal-title":"IEEE Trans Neural Netw"},{"issue":"3","key":"7044_CR17","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1007\/s10489-017-0936-x","volume":"47","author":"S Kortik","year":"2017","unstructured":"Kortik S, Saranli U (2017) LinGraph: a graph-based automated planner for concurrent task planning based on linear logic. Appl Intell 47(3):914\u2013934","journal-title":"Appl Intell"},{"issue":"1","key":"7044_CR18","first-page":"3","volume":"160","author":"SB Kotsiantis","year":"2007","unstructured":"Kotsiantis SB, Zaharakis I, Pintelas P (2007) Supervised machine learning: a review of classification techniques. Emerg Artif Intell Appl Comput Eng 160(1):3\u201324","journal-title":"Emerg Artif Intell Appl Comput Eng"},{"key":"7044_CR19","doi-asserted-by":"publisher","first-page":"185232","DOI":"10.1109\/ACCESS.2020.3030226","volume":"8","author":"AW Li","year":"2020","unstructured":"Li AW, Bastos GS (2020) Stock market forecasting using deep learning and technical analysis: a systematic review. IEEE Access 8:185232\u2013185242","journal-title":"IEEE Access"},{"key":"7044_CR20","doi-asserted-by":"crossref","unstructured":"Lipovetzky N, Geffner H (2017) A polynomial planning algorithm that beats LAMA and FF. Twenty-seventh international conference on automated planning and scheduling","DOI":"10.1609\/icaps.v27i1.13822"},{"key":"7044_CR21","doi-asserted-by":"crossref","unstructured":"Mathew A, Amudha P, Sivakumari S (2020) Deep learning techniques: an overview. International conference on advanced machine learning technologies and applications. Springer, Singapore, pp 599\u2013608","DOI":"10.1007\/978-981-15-3383-9_54"},{"issue":"7540","key":"7044_CR22","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1038\/nature14236","volume":"518","author":"V Mnih","year":"2015","unstructured":"Mnih V, Kavukcuoglu K, Silver D, Rusu AA, Veness J, Bellemare MG, Graves A, Riedmiller M, Fidjeland AK, Ostrovski G (2015) Human-level control through deep reinforcement learning. Nature 518(7540):529\u2013533","journal-title":"Nature"},{"key":"7044_CR23","unstructured":"Mnih V, Badia AP, Mirza M, Graves A, Lillicrap T, Harley T, Silver D, Kavukcuoglu K (2016)  Asynchronous methods for deep reinforcement learning. In: International conference on machine learning. PMLR, pp 1928\u20131937"},{"key":"7044_CR24","volume-title":"Adaptive pattern recognition and neural networks","author":"Y Pao","year":"1989","unstructured":"Pao Y (1989) Adaptive pattern recognition and neural networks. Addison Wesley Publishing Company, Reading, MA"},{"key":"7044_CR25","unstructured":"Pelikan M, Goldberg DE, Tsutsui S (2003) Hierarchical Bayesian optimization algorithm: toward a new generation of evolutionary algorithms. SICE 2003 annual conference (IEEE Cat. no. 03TH8734), 3, pp 2738\u20132743"},{"key":"7044_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.103684","volume":"92","author":"E Pira","year":"2020","unstructured":"Pira E (2020) A novel approach to solve AI planning problems in graph transformations. Eng Appl Artif Intell 92:103684. https:\/\/doi.org\/10.1016\/j.engappai.2020.103684","journal-title":"Eng Appl Artif Intell"},{"key":"7044_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/s11219-020-09542-x","author":"E Pira","year":"2021","unstructured":"Pira E (2021) Using knowledge discovery to propose a two-phase model checking for safety analysis of graph transformations. Softw Qual J. https:\/\/doi.org\/10.1007\/s11219-020-09542-x","journal-title":"Softw Qual J"},{"key":"7044_CR28","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1016\/j.asoc.2016.06.039","volume":"49","author":"E Pira","year":"2016","unstructured":"Pira E, Rafe V, Nikanjam A (2016) EMCDM: efficient model checking by data mining for verification of complex software systems specified through architectural styles. Appl Soft Comput 49:1185\u20131201","journal-title":"Appl Soft Comput"},{"key":"7044_CR29","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.infsof.2018.01.004","volume":"97","author":"E Pira","year":"2018","unstructured":"Pira E, Rafe V, Nikanjam A (2018) Searching for violation of safety and liveness properties using knowledge discovery in complex systems specified through graph transformations. Inf Softw Technol 97:110\u2013134","journal-title":"Inf Softw Technol"},{"key":"7044_CR30","doi-asserted-by":"publisher","first-page":"106577","DOI":"10.1016\/j.ress.2019.106577","volume":"191","author":"E Pira","year":"2019","unstructured":"Pira E, Rafe V, Nikanjam A (2019) Using evolutionary algorithms for reachability analysis of complex software systems specified through graph transformation. Reliab Eng Syst Saf 191:106577","journal-title":"Reliab Eng Syst Saf"},{"issue":"12","key":"7044_CR31","doi-asserted-by":"publisher","first-page":"4531","DOI":"10.1007\/s00500-018-3444-y","volume":"23","author":"V Rafe","year":"2019","unstructured":"Rafe V, Darghayedi M, Pira E (2019) MS-ACO: a multi-stage ant colony optimization to refute complex software systems specified through graph transformation. Soft Comput 23(12):4531\u20134556","journal-title":"Soft Comput"},{"key":"7044_CR32","doi-asserted-by":"publisher","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":"7044_CR33","volume-title":"Handbook of graph grammars and comp, vol 1","author":"G Rozenberg","year":"1997","unstructured":"Rozenberg G (1997) Handbook of graph grammars and comp, vol 1. World scientific, Singapore"},{"key":"7044_CR34","volume-title":"Artificial intelligence: a modern approach","author":"SJ Russell","year":"2016","unstructured":"Russell SJ, Norvig P (2016) Artificial intelligence: a modern approach. Pearson Education Limited, Malaysia"},{"key":"7044_CR35","volume-title":"Model checking of visual modeling languages","author":"\u00c1 Schmidt","year":"2004","unstructured":"Schmidt \u00c1 (2004) Model checking of visual modeling languages. Budapest University of Technology, Hungary"},{"key":"7044_CR36","doi-asserted-by":"crossref","unstructured":"Shen W, Trevizan F, Thi\u00e9baux S (2019) Learning domain-independent planning heuristics with hypergraph networks. arXiv:1911.13101","DOI":"10.1609\/icaps.v30i1.6754"},{"key":"7044_CR37","first-page":"7715","volume":"33","author":"S Sievers","year":"2019","unstructured":"Sievers S, Katz M, Sohrabi S, Samulowitz H, Ferber P (2019) Deep learning for cost-optimal planning: task-dependent planner selection. Proc AAAI Conf Artif Intell 33:7715\u20137723","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"7044_CR38","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/3-540-44399-1_10","volume-title":"Advances in artificial intelligence IBERAMIA SBIA 2000 Lecture notes in computer science","author":"F Silva","year":"2000","unstructured":"Silva F, Alexandre Castilho M, Allan K\u00fcnzle L (2000) Petriplan: a new algorithm for plan generation (preliminary report). In: Monard MC, Sichman JS (eds) Advances in artificial intelligence. IBERAMIA SBIA 2000. Lecture notes in computer science. Springer, Berlin, Heidelberg, pp 86\u201395. https:\/\/doi.org\/10.1007\/3-540-44399-1_10"},{"key":"7044_CR39","unstructured":"Snippe E (2011) Using heuristic search to solve planning problems in GROOVE. 14th Twente Student Conference on IT, University of Twente. Available at Fmt. Cs. Utwente. Nl\/Education\/Bachelor\/73"},{"issue":"3\u20134","key":"7044_CR40","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF00992696","volume":"8","author":"RJ Williams","year":"1992","unstructured":"Williams RJ (1992) Simple statistical gradient-following algorithms for connectionist reinforcement learning. Mach Learn 8(3\u20134):229\u2013256","journal-title":"Mach Learn"},{"key":"7044_CR41","doi-asserted-by":"crossref","unstructured":"Ziegert S (2014) Graph transformation planning via abstraction. arXiv:1407.7933","DOI":"10.4204\/EPTCS.159.7"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07044-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-022-07044-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07044-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T06:27:23Z","timestamp":1664519243000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-022-07044-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,6]]},"references-count":41,"journal-issue":{"issue":"22","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["7044"],"URL":"https:\/\/doi.org\/10.1007\/s00500-022-07044-5","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,6]]},"assertion":[{"value":"19 March 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there is no conflict of interest for any of them in this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}