The dominating set reconfiguration problem is defined as determining, for a given dominating set problem and two among its feasible solutions, whether one is reachable from the other via a sequence of feasible solutions subject to a certain adjacency relation. This problem is PSPACE-complete in general. The concept of the dominating set is known to be quite useful for analyzing wireless networks, social networks, and sensor networks. We develop an approach to solve the dominating set reconfiguration problem based on Answer Set Programming (ASP). Our declarative approach relies on a high-level ASP encoding, and both the grounding and solving tasks are delegated to an ASP-based combinatorial reconfiguration solver. To evaluate the effectiveness of our approach, we conduct experiments on a newly created benchmark set.

翻译：支配集重构问题定义为：对于给定的支配集问题及其两个可行解，判断是否可以通过一系列满足特定邻接关系的可行解，从一个解转换到另一个解。该问题在一般情况下是PSPACE完全的。支配集的概念在分析无线网络、社交网络和传感器网络方面具有重要应用价值。本文提出了一种基于答案集编程（ASP）的支配集重构问题求解方法。我们的声明式方法依赖于高级ASP编码，并将实例化和求解任务均委托给基于ASP的组合重构求解器。为评估所提方法的有效性，我们在新创建的基准测试集上进行了实验。