Recongo: Bounded Combinatorial Reconfiguration with Answer Set Programming

Abstract We develop an approach called bounded combinatorial reconfiguration for solving combinatorial reconfiguration problems based on Answer Set Programming. 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.

Authors

• Yuya Yamada
• Mutsunori Banbara
• Katsumi Inoue
• Torsten Schaub

Keywords

No keywords are indexed for this paper.