颜色结构与变量出现次数受限的单调可满足性问题
Color Structures and the Monotone Satisfiability Problem with Bounded Variable Occurrence
AI总结:
研究\textsc{单调3-Sat-$(\leq k,1)$}问题,引入颜色结构概念,证明对于$k\in \{3,4\}$该问题平凡可满足,填补二分法定理空白,且能在$\mathcal{O}(n \cdot m)$时间内构造满足赋值。
摘要:
我们研究了\textsc{单调3-Sat-$(\leq k,1)$},它是可满足性问题的一个受限变体,其中子句由三个变量组成且是单调的(每个子句仅包含未否定或仅否定的变量),公式中每个变量最多有$k$次正出现且恰好有一次负出现。我们解决了Darmann和Döcker提出的一个挑战,证明对于$k\in \{3,4\}$,该问题是平凡的,即每个满足给定限制的实例都是可满足的。此结果填补了二分法定理中的剩余空白。为得到该结果,我们引入了“颜色结构”的概念,并表明总能在$\mathcal{O}(n \cdot m)$时间内构造出一个满足赋值,其中$n$和$m$分别表示输入公式中负子句和正子句的数量。
英文摘要:
We study \textsc{Monotone 3-Sat-$(\leq k,1)$}, a restricted variant of the \textsc{Satisfiability} problem where clauses consist of three variables and are monotone (every clause contains either only unnegated or only negated variables) with up to $k$ positive and exactly one negative occurrence per variable in the formula. We resolve a challenge posed by Darmann and Döcker (On simplified NP-complete variants of \textsc{Monotone} 3-\textsc{Sat}, Discrete Applied Mathematics 292:45--58, 2021) by proving that for~$k\in \{3,4\}$, the problem is trivial in the sense that every instance satisfying the given restrictions is satisfiable. This result closes the remaining gap in a dichotomy theorem: Triviality for $k\in \{1,2\}$ follows by a result by Tovey (A simplified NP-complete satisfiability problem, Discrete Applied Mathematics 8(1):85--89, 1984), while NP-completeness for~$k\geq 5$ was shown by Darmann and Döcker. To obtain our result, we introduce the notion of \emph{color structures} and show that a satisfying assignment can always be constructed in $\mathcal{O}(n \cdot m)$ time, where $n$ and $m$ denote the number of negative and positive clauses of the input formula, respectively.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。