{"type":"ScholarlyArticle","title":"Capturing (Optimal) Relaxed Plans with Stable and Supported Models of Logic Programs (Extended Abstract)","authors":[{"name":"Masood Feyzbakhsh Rankooh","slug":"masood-feyzbakhsh-rankooh","given":"Masood","family":"Feyzbakhsh Rankooh","affiliation":"Tampere University , Tampere , Finland"},{"name":"Tomi Janhunen","slug":"tomi-janhunen","given":"Tomi","family":"Janhunen","affiliation":"Tampere University , Tampere , Finland"}],"abstract":"We establish a novel relation between delete-free planning, an important task for the AI Planning community also known as relaxed planning, and logic programming. We show that given a planning problem, all subsets of actions that could be ordered to produce relaxed plans for the problem can be bijectively captured with stable models of a logic program describing the corresponding relaxed planning problem. We also consider the supported model semantics of logic programs, and introduce one causal and one diagnostic encoding of the relaxed planning problem as logic programs, both capturing relaxed plans with their supported models. Our experimental results show that these new encodings can provide major performance gain when computing optimal relaxed plans.","doi":"10.24963/ijcai.2024/930","url":"https://ijcai.org/proceedings/2024/930","pdf":"https://ijcai.org/proceedings/2024/0930.pdf","markdown":"https://ijcai.org/proceedings/2024/930.md","bibtex":"https://ijcai.org/proceedings/2024/bibtex/930","volume":{"slug":"2024","title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2024","url":"https://ijcai.org/proceedings/2024/","year":2024,"location":"Jeju, Korea","dates":"3-9 August 2024","editors":"Kate Larson","isbn":"978-1-956792-04-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2024"},"section":"Sister Conferences Best Papers","track":"Sister Conferences Best Papers","number":930,"pages":{"first":8399,"last":8404},"keywords":["Knowledge Representation and Reasoning: KRR: Logic programming","Knowledge Representation and Reasoning: KRR: Causality","Knowledge Representation and Reasoning: KRR: Reasoning about actions","Planning and Scheduling: General"],"videos":[],"references":[{"position":1,"raw":"[Betz and Helmert, 2009] Christoph Betz and Malte Helmert. Planning with h + in theory and practice. In Bärbel Mertsching, Marcus Hund, and Muhammad Zaheer Aziz, editors, KI 2009: Advances in Artificial Intelligence, 32nd Annual German Conference on AI, Paderborn, Germany, September 15-18, 2009. Proceedings, volume 5803 of Lecture Notes in Computer Science, pages 9-16. Springer, 2009.","title":"Planning with h + in theory and practice","authors":"Helmert Betz, Christoph Betz, Malte Helmert","year":"2009","venue":"Advances in Artificial Intelligence, 32nd Annual German Conference on AI","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bomanson et al., 2016] Jori Bomanson, Martin Gebser, Tomi Janhunen, Benjamin Kaufmann, and Torsten Schaub. Answer set programming modulo acyclicity. Fundam. In- formaticae, 147(1):63-91, 2016.","title":"Answer set programming modulo acyclicity","authors":"Jori Bomanson, Martin Gebser, Tomi Janhunen, Benjamin Kaufmann, Torsten Schaub","year":"2016","venue":"Fundam. Informaticae","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bonet and Geffner, 2001] Blai Bonet and Hector Geffner. Planning as heuristic search. Artificial Intelligence, 129(1- 2):5-33, 2001.","title":"Planning as heuristic search","authors":"Geffner Bonet, Blai Bonet, Hector Geffner","year":"2001","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Brewka et al., 2011] Gerhard Brewka, Thomas Eiter, and Miroslaw Truszczynski. Answer set programming at a glance. Commun. ACM, 54(12):92-103, 2011.","title":"Answer set programming at a glance","authors":"Gerhard Brewka, Thomas Eiter, Miroslaw Truszczynski","year":"2011","venue":"Commun. ACM","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bylander, 1994] Tom Bylander. The computational com- plexity of propositional STRIPS planning. Artif. Intell., 69(1-2):165-204, 1994.","title":"The computational complexity of propositional STRIPS planning","authors":"Tom Bylander","year":"1994","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Gebser et al., 2015] Martin Gebser, Roland Kaminski, Ben- jamin Kaufmann, Javier Romero, and Torsten Schaub. Progress in clasp series 3. In LPNMR 2015, pages 368- 383, 2015.","title":"Progress in clasp series 3","authors":"Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Javier Romero, Torsten Schaub","year":"2015","venue":"LPNMR 2015","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Gefen and Brafman, 2011] Avitan Gefen and Ronen I. Braf- man. The minimal seed set problem. In Fahiem Bacchus, Carmel Domshlak, Stefan Edelkamp, and Malte Helmert, editors, Proceedings of the 21st International Conference on Automated Planning and Scheduling, ICAPS 2011, Freiburg, Germany June 11-16, 2011. AAAI, 2011.","title":"Brafman. The minimal seed set problem","authors":"Avitan Gefen, Ronen I","year":"2011","venue":"Proceedings of the 21st International Conference on Automated Planning and Scheduling, ICAPS 2011","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Gelfond and Lifschitz, 1988] Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. In Proceedings of ICLP'88, pages 1070-1080, 1988.","title":"The stable model semantics for logic programming","authors":"Michael Gelfond, Vladimir Lifschitz","year":"1988","venue":"Proceedings of ICLP'88","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Haslum et al., 2012] Patrik Haslum, John K. Slaney, and Sylvie Thiébaux. Minimal landmarks for optimal delete- free planning. In Proceedings of the Twenty-Second Inter- national Conference on Automated Planning and Schedul- ing, ICAPS 2012, pages 353-357. AAAI Press, 2012.","title":"Minimal landmarks for optimal deletefree planning","authors":"Haslum","year":"2012","venue":"Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, ICAPS 2012","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Haslum, 2012] Patrik Haslum. Incremental lower bounds for additive cost planning problems. In Lee McCluskey, Brian Charles Williams, José Reinaldo Silva, and Blai Bonet, editors, Proceedings of the Twenty-Second Inter- national Conference on Automated Planning and Schedul- ing, ICAPS 2012, Atibaia, São Paulo, Brazil, June 25-19, 2012. AAAI, 2012.","title":"Incremental lower bounds for additive cost planning problems","authors":"Patrik Haslum, Haslum","year":"2012","venue":"Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, ICAPS 2012","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Haslum, 2015] Patrik Haslum. Hsp* code and documen- tation http://users.cecs.anu.edu.au/patrik/un-hsps.html., 2015. [Helmert and Domshlak, 2009] Malte Helmert and Carmel Domshlak. Landmarks, critical paths and abstractions: What's the difference anyway? In Alfonso Gerevini, Adele E. Howe, Amedeo Cesta, and Ioannis Refanidis, ed- itors, Proceedings of the 19th International Conference on Automated Planning and Scheduling, ICAPS 2009, Thes- saloniki, Greece, September 19-23, 2009. AAAI, 2009.","title":"Landmarks, critical paths and abstractions: What's the difference anyway?","authors":"; Haslum, Domshlak Helmert, Malte Helmert, Carmel Domshlak","year":"2009","venue":"Proceedings of the 19th International Conference on Automated Planning and Scheduling, ICAPS 2009","doi":null,"url":"http://users.cecs.anu.edu.au/patrik/un-hsps.html","internal_url":null},{"position":12,"raw":"[Imai and Fukunaga, 2015] Tatsuya Imai and Alex Fuku- naga. On a practical, integer-linear programming model for delete-free tasks and its use as a heuristic for cost- optimal planning. Journal of Artificial Intelligence Re- search, 54:631-677, 2015.","title":"Tatsuya Imai and Alex Fukunaga. On a practical, integer-linear programming model for delete-free tasks and its use as a heuristic for costoptimal planning","authors":"Fukunaga Imai","year":"2015","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Keyder and Geffner, 2008] Emil Keyder and Hector Geffner. Heuristics for planning with action costs re- visited. In Malik Ghallab, Constantine D. Spyropoulos, Nikos Fakotakis, and Nikolaos M. Avouris, editors, ECAI 2008 -18th European Conference on Artificial Intelli- gence, Patras, Greece, July 21-25, 2008, Proceedings, volume 178 of Frontiers in Artificial Intelligence and Applications, pages 588-592. IOS Press, 2008.","title":"Heuristics for planning with action costs revisited","authors":"Geffner Keyder, Emil Keyder, Hector Geffner","year":"2008","venue":"ECAI 2008 -18th European Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Marek and Subrahmanian, 1992] Victor Witold Marek and Venkatramanan Siva Subrahmanian. The relationship be- tween stable, supported, default and autoepistemic seman- tics for general logic programs. Theor. Comput. Sci., 103(2):365-386, 1992.","title":"Victor Witold Marek and Venkatramanan Siva Subrahmanian. The relationship between stable, supported, default and autoepistemic semantics for general logic programs","authors":"Subrahmanian Marek","year":"1992","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Mirkis and Domshlak, 2007] Vitaly Mirkis and Carmel Domshlak. Cost-sharing approximations for h+. In","title":"Cost-sharing approximations for h+","authors":"Vitaly Mirkis, Carmel Domshlak","year":null,"venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"raw":"Mark S. Boddy, Maria Fox, and Sylvie Thiébaux, edi- tors, Proceedings of the Seventeenth International Con- ference on Automated Planning and Scheduling, ICAPS 2007, Providence, Rhode Island, USA, September 22-26, 2007, pages 240-247. AAAI, 2007.","title":"editors","authors":"Mark S Boddy, Maria Fox, Sylvie Thiébaux","year":"2007","venue":"Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling, ICAPS 2007","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Rankooh and Janhunen, 2022] Masood Feyzbakhsh Rankooh and Tomi Janhunen. Efficient computation of answer sets via SAT modulo acyclicity and vertex elim- ination. In Georg Gottlob, Daniela Inclezan, and Marco Maratea, editors, Logic Programming and Nonmonotonic Reasoning -16th International Conference, LPNMR 2022, Genova, Italy, September 5-9, 2022, Proceedings, volume 13416 of Lecture Notes in Computer Science, pages 203-216. Springer, 2022.","title":"Efficient computation of answer sets via SAT modulo acyclicity and vertex elimination","authors":"Masood Feyzbakhsh, Rankooh, Tomi Janhunen","year":"2022","venue":"Logic Programming and Nonmonotonic Reasoning -16th International Conference, LPNMR 2022","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Rankooh and Janhunen, 2023] Masood Feyzbakhsh Rankooh and Tomi Janhunen. Capturing (optimal) relaxed plans with stable and supported models of logic programs. Theory Pract. Log. Program., 23(4):1-15, 2023.","title":"Capturing (optimal) relaxed plans with stable and supported models of logic programs","authors":"Masood Feyzbakhsh, Rankooh, Tomi Janhunen","year":"2023","venue":"Theory Pract. Log. Program","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Rankooh and Rintanen, 2022a] Masood Feyzbakhsh Rankooh and Jussi Rintanen. Efficient computation and informative estimation of h+ by integer and linear pro- gramming. In Akshat Kumar, Sylvie Thiébaux, Pradeep Varakantham, and William Yeoh, editors, Proceedings of the Thirty-Second International Conference on Auto- mated Planning and Scheduling, ICAPS 2022, Singapore (virtual), June 13-24, 2022, pages 71-79. AAAI Press, 2022.","title":"Efficient computation and informative estimation of h+ by integer and linear programming","authors":"Rintanen ; Rankooh, Feyzbakhsh Masood, Jussi Rankooh, Rintanen","year":"2022","venue":"Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, ICAPS 2022","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Rankooh and Rintanen, 2022b] Masood Feyzbakhsh Rankooh and Jussi Rintanen. Efficient encoding of cost optimal delete-free planning as SAT. In Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Virtual Event, February 22 -March 1, 2022, pages 9910-9917. AAAI Press, 2022.","title":"Efficient encoding of cost optimal delete-free planning as SAT","authors":"Rintanen ; Rankooh, Feyzbakhsh Masood, Jussi Rankooh, Rintanen","year":"2022","venue":"Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Virtual Event","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Rankooh and Rintanen, 2022c] Masood Feyzbakhsh Rankooh and Jussi Rintanen. Propositional encodings of acyclicity and reachability by using vertex elimination. In Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, 2022 Virtual Event, February 22 -March 1, 2022, pages 5861-5868. AAAI Press, 2022.","title":"Masood Feyzbakhsh Rankooh and Jussi Rintanen. Propositional encodings of acyclicity and reachability by using vertex elimination","authors":"Rintanen Rankooh","year":"2022","venue":"Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, 2022 Virtual Event","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Robinson et al., 2014] Nathan Robinson, Sheila A. McIl- raith, and David Toman. Cost-based query optimization via AI planning. In Carla E. Brodley and Peter Stone, ed- itors, Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27 -31, 2014, Québec City, Québec, Canada, pages 2344-2351. AAAI Press, 2014.","title":"Cost-based query optimization via AI planning","authors":"Nathan Robinson, Sheila A Mcilraith, David Toman","year":"2014","venue":"Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Rose and Tarjan, 1975] Donald J. Rose and Robert Endre Tarjan. Algorithmic aspects of vertex elimination. In Pro- ceedings of the 7th Annual ACM Symposium on Theory of Computing, pages 245-254, 1975.","title":"Algorithmic aspects of vertex elimination","authors":"Donald J Rose, Robert Endre Tarjan","year":"1975","venue":"Proceedings of the 7th Annual ACM Symposium on Theory of Computing","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Russell and Norvig, 2020] Stuart Russell and Peter Norvig. Artificial Intelligence: A Modern Approach (4th Edition).","title":"Artificial Intelligence: A Modern Approach","authors":"Stuart Russell, Peter Norvig","year":null,"venue":null,"doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Simons et al., 2002] Patrik Simons, Ilkka Niemelä, and Timo Soininen. Extending and implementing the stable model semantics. Artificial Intelligence, 138(1-2):181- 234, 2002.","title":"Extending and implementing the stable model semantics","authors":"Simons","year":"2002","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}