Bounded Combinatorial Reconfiguration with Answer Set Programming
This work addresses combinatorial reconfiguration problems for researchers and practitioners in computational logic and optimization, but it is incremental as it builds on existing ASP methods.
The paper tackled combinatorial reconfiguration problems by developing a bounded approach using Answer Set Programming (ASP), resulting in the recongo solver that ranked first in the shortest metric of the single-engine solvers track at the CoRe Challenge 2022.
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.