@inproceedings{christen2023paris,
  title        = {{PARIS}: Planning Algorithms for Reconfiguring Independent Sets},
  author       = {Christen, Remo and Eriksson, Salom{\'e} and Katz, Michael and Muise, Christian and Petrov, Alice and Pommerening, Florian and Seipp, Jendrik and Sievers, Silvan and Speck, David},
  booktitle    = {Proceedings of the 30th European Conference on Artificial Intelligence (ECAI 2023)},
  year         = {2023},
  url_paper    = {https://alicepetrov.github.io/assets/pdf/papers/2023/christen2023paris.pdf},
  abstract     = {Combinatorial reconfiguration is the problem of transforming one solution of a combinatorial problem into another, where each transformation may only apply small changes to a solution and may not leave the solution space. An important example is the independent set reconfiguration (ISR) problem, where an independent set of a graph (a subset of its vertices without edges between them) has to be transformed into another by a sequence of transformations that can replace a vertex in the current subset such that the new subset is still an independent set. The 1st Combinatorial Reconfiguration Challenge (CoRe Challenge 2022) was a competition focused on the ISR problem. The PARIS team successfully participated with two solvers that model the ISR problem as a planning task and employ different planning techniques for solving it. In this work, we describe these models and solvers. For a fair comparison to competing ISR approaches, we re-run the entire competition under equal computational conditions. Besides showcasing the success of planning technology, we hope that this work will create a cross-fertilization of the two research fields. },
  keywords     = {AI Planning & Reasoning}
}

{"_id":"AJi8pvyeTz556vLpw","bibbaseid":"christen-eriksson-katz-muise-petrov-pommerening-seipp-sievers-etal-parisplanningalgorithmsforreconfiguringindependentsets-2023","author_short":["Christen, R.","Eriksson, S.","Katz, M.","Muise, C.","Petrov, A.","Pommerening, F.","Seipp, J.","Sievers, S.","Speck, D."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"PARIS: Planning Algorithms for Reconfiguring Independent Sets","author":[{"propositions":[],"lastnames":["Christen"],"firstnames":["Remo"],"suffixes":[]},{"propositions":[],"lastnames":["Eriksson"],"firstnames":["Salomé"],"suffixes":[]},{"propositions":[],"lastnames":["Katz"],"firstnames":["Michael"],"suffixes":[]},{"propositions":[],"lastnames":["Muise"],"firstnames":["Christian"],"suffixes":[]},{"propositions":[],"lastnames":["Petrov"],"firstnames":["Alice"],"suffixes":[]},{"propositions":[],"lastnames":["Pommerening"],"firstnames":["Florian"],"suffixes":[]},{"propositions":[],"lastnames":["Seipp"],"firstnames":["Jendrik"],"suffixes":[]},{"propositions":[],"lastnames":["Sievers"],"firstnames":["Silvan"],"suffixes":[]},{"propositions":[],"lastnames":["Speck"],"firstnames":["David"],"suffixes":[]}],"booktitle":"Proceedings of the 30th European Conference on Artificial Intelligence (ECAI 2023)","year":"2023","url_paper":"https://alicepetrov.github.io/assets/pdf/papers/2023/christen2023paris.pdf","abstract":"Combinatorial reconfiguration is the problem of transforming one solution of a combinatorial problem into another, where each transformation may only apply small changes to a solution and may not leave the solution space. An important example is the independent set reconfiguration (ISR) problem, where an independent set of a graph (a subset of its vertices without edges between them) has to be transformed into another by a sequence of transformations that can replace a vertex in the current subset such that the new subset is still an independent set. The 1st Combinatorial Reconfiguration Challenge (CoRe Challenge 2022) was a competition focused on the ISR problem. The PARIS team successfully participated with two solvers that model the ISR problem as a planning task and employ different planning techniques for solving it. In this work, we describe these models and solvers. For a fair comparison to competing ISR approaches, we re-run the entire competition under equal computational conditions. Besides showcasing the success of planning technology, we hope that this work will create a cross-fertilization of the two research fields. ","keywords":"AI Planning & Reasoning","bibtex":"@inproceedings{christen2023paris,\n title = {{PARIS}: Planning Algorithms for Reconfiguring Independent Sets},\n author = {Christen, Remo and Eriksson, Salom{\\'e} and Katz, Michael and Muise, Christian and Petrov, Alice and Pommerening, Florian and Seipp, Jendrik and Sievers, Silvan and Speck, David},\n booktitle = {Proceedings of the 30th European Conference on Artificial Intelligence (ECAI 2023)},\n year = {2023},\n url_paper = {https://alicepetrov.github.io/assets/pdf/papers/2023/christen2023paris.pdf},\n abstract = {Combinatorial reconfiguration is the problem of transforming one solution of a combinatorial problem into another, where each transformation may only apply small changes to a solution and may not leave the solution space. An important example is the independent set reconfiguration (ISR) problem, where an independent set of a graph (a subset of its vertices without edges between them) has to be transformed into another by a sequence of transformations that can replace a vertex in the current subset such that the new subset is still an independent set. The 1st Combinatorial Reconfiguration Challenge (CoRe Challenge 2022) was a competition focused on the ISR problem. The PARIS team successfully participated with two solvers that model the ISR problem as a planning task and employ different planning techniques for solving it. In this work, we describe these models and solvers. For a fair comparison to competing ISR approaches, we re-run the entire competition under equal computational conditions. Besides showcasing the success of planning technology, we hope that this work will create a cross-fertilization of the two research fields. },\n keywords = {AI Planning & Reasoning}\n}\n","author_short":["Christen, R.","Eriksson, S.","Katz, M.","Muise, C.","Petrov, A.","Pommerening, F.","Seipp, J.","Sievers, S.","Speck, D."],"key":"christen2023paris","id":"christen2023paris","bibbaseid":"christen-eriksson-katz-muise-petrov-pommerening-seipp-sievers-etal-parisplanningalgorithmsforreconfiguringindependentsets-2023","role":"author","urls":{" paper":"https://alicepetrov.github.io/assets/pdf/papers/2023/christen2023paris.pdf"},"keyword":["AI Planning & Reasoning"],"metadata":{"authorlinks":{}},"downloads":5},"bibtype":"inproceedings","biburl":"https://raw.githubusercontent.com/alicepetrov/alicepetrov.github.io/main/_bibliography/papers.bib","dataSources":["WAuJLwywKRHbCMAEF","DprwGzu9heN5GXy3u","wMCdMNmiucDu2pMmz","5fDj6rXeRevQyZND4","9fesATq77fFWtSPuB","TxReNv8mFMbHT3GnN","adWMgNS3S9SmwmtLP","2Eox22rXM4CLdebT7","Q3hkt85LkKqqkfHnA"],"keywords":["ai planning & reasoning"],"search_terms":["paris","planning","algorithms","reconfiguring","independent","sets","christen","eriksson","katz","muise","petrov","pommerening","seipp","sievers","speck"],"title":"PARIS: Planning Algorithms for Reconfiguring Independent Sets","year":2023,"downloads":5}