BriefGPT.xyz
Jul, 2021
利用拼块特性解决无限域CSP问题
Solving Infinite-Domain CSPs Using the Patchwork Property
HTML
PDF
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
TL;DR
研究了约束满足问题中基本关系具有小拼接性质的CSP,提出了一种求解这类问题的算法,时间复杂度为f(w)·n^{O(1)},并且不仅限于二元约束。
Abstract
The
constraint satisfaction problem
(CSP) has important applications in computer science and AI. In particular,
infinite-domain csps
have been intensively used in subareas of AI such as spatio-temporal reasoning.
→