arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1909.08240cs.AI
收藏

互斥图和多重逻辑:减少规划的基础大小

Mutex Graphs and Multicliques: Reducing Grounding Size for Planning

University of Alberta(阿尔伯塔大学)

David Spies, Jia-Huai You, Ryan Hayward

摘要:

我们提出了一种方法来表示大型互斥集,也称为互斥或互斥约束。这些类型的约束指定了某些属性、事件、进程等的排除,它们在许多应用领域中普遍存在。对于给定的问题,这些约束的大小可能是压倒性的,足以对底层求解器的求解效率造成瓶颈。在本文中,我们提出了一种新的图论技术的基础上multicliques的互斥约束的紧凑表示,并将其应用到域独立的规划在ASP。由于计算一个最小的multiclique覆盖从互斥图是NP-难的,我们提出了一个有效的近似算法multiclique覆盖,并通过实验表明,它产生的互斥约束在ASP比以前已知的工作在SAT基本上更小的接地尺寸。

英文摘要:

We present an approach to representing large sets of mutual exclusions, also known as mutexes or mutex constraints. These are the types of constraints that specify the exclusion of some properties, events, processes, and so on. They are ubiquitous in many areas of applications. The size of these constraints for a given problem can be overwhelming enough to present a bottleneck for the solving efficiency of the underlying solver. In this paper, we propose a novel graph-theoretic technique based on multicliques for a compact representation of mutex constraints and apply it to domain-independent planning in ASP. As computing a minimum multiclique covering from a mutex graph is NP-hard, we propose an efficient approximation algorithm for multiclique covering and show experimentally that it generates substantially smaller grounding size for mutex constraints in ASP than the previously known work in SAT.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑