论文标题
HyperTrac项目：有关超图解分解的最新进展和未来研究指示
The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions
论文作者
论文摘要
约束满意度问题（CSP）在人工智能和运营研究中的许多应用中起着核心作用。通常，求解CSP是NP完整的。 CSP的结构最好由HyperGraphs描述。因此，在文献中提出了各种形式的超晶分解，以鉴定CSP的拖拉片段。但是，混凝土超毛电分解的计算本身就是一项具有挑战性的任务。在本文中，我们报告了HyperGraph分解研究的最新进展，并概述了几个方向以进行未来的研究。
Constraint Satisfaction Problems (CSPs) play a central role in many applications in Artificial Intelligence and Operations Research. In general, solving CSPs is NP-complete. The structure of CSPs is best described by hypergraphs. Therefore, various forms of hypergraph decompositions have been proposed in the literature to identify tractable fragments of CSPs. However, also the computation of a concrete hypergraph decomposition is a challenging task in itself. In this paper, we report on recent progress in the study of hypergraph decompositions and we outline several directions for future research.
