We develop an approach called bounded combinatorial reconfiguration for solving combinatorial reconfiguration problems based on Answer Set Programming (ASP). The general task is to study the solution spaces of source combinatorial problems and to decide whether or not there are sequences of feasible solutions that have special properties. The resulting recongo solver covers all metrics of the solver track in the most recent international competition on combinatorial reconfiguration (CoRe Challenge 2022). recongo ranked first in the shortest metric of the single-engine solvers track. In this paper, we present the design and implementation of bounded combinatorial reconfiguration, and present an ASP encoding of the independent set reconfiguration problem that is one of the most studied combinatorial reconfiguration problems. Finally, we present empirical analysis considering all instances of CoRe Challenge 2022.

我们提出了一种称为有界组合重新配置的方法，用于基于Answer Set Programming（ASP）解决组合重新配置问题。我们设计和实现了有界组合重新配置，并提出了独立集重新配置问题的ASP编码，这是最研究的组合重新配置问题之一。通过考虑CoRe Challenge 2022的所有实例，我们进行了实证分析。

基于答集编程的有界组合重新配置