基于Skolem算法的约束满足问题
Constraint Satisfaction Problems around Skolem Arithmetic
摘要：
我们研究Skolem算法和某些类别的约束满足问题（CSP）之间的相互作用。在CSP的背景下，我们重新审视了Glass er等人的结果，并解决了该论文中的主要开放问题，发现电路上的某种满意度问题是可判定的。这一点，我们证明使用的可判定性Skolem算术。我们继续研究不带常数的Skolem算术的一阶展开（N;*），其中 * 表示乘法，作为CSP。我们已经在这里发现了一个丰富的景观问题的非平凡的情况下，在P以及那些是NP完全的。
英文摘要：
We study interactions between Skolem Arithmetic and certain classes of Constraint Satisfaction Problems (CSPs). We revisit results of Glass er et al. in the context of CSPs and settle the major open question from that paper, finding a certain satisfaction problem on circuits to be decidable. This we prove using the decidability of Skolem Arithmetic. We continue by studying first-order expansions of Skolem Arithmetic without constants, (N;*), where * indicates multiplication, as CSPs. We find already here a rich landscape of problems with non-trivial instances that are in P as well as those that are NP-complete.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
