基于回答集编程的支配集重构问题
Dominating Set Reconfiguration with Answer Set Programming
AI总结：
本文提出基于回答集编程的支配集重构问题求解方法，通过高级ASP编码并委托给组合重构求解器，在新基准集上验证了有效性。
摘要：
支配集重构问题定义为：对于给定的支配集问题及其两个可行解，判断其中一个是否可以通过一系列满足特定邻接关系的可行解到达另一个。该问题在一般情况下是PSPACE完全的。支配集的概念已知在分析无线网络、社交网络和传感器网络方面非常有用。我们开发了一种基于回答集编程（ASP）的方法来解决支配集重构问题。我们的声明式方法依赖于高级ASP编码，并且接地（grounding）和求解任务都委托给一个基于ASP的组合重构求解器。为了评估我们方法的有效性，我们在一个新创建的基准集上进行了实验。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
