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

P以下的约束满足问题

On Constraint Satisfaction Problems below P

Laszlo Egri

摘要:

对称数据库是逻辑程序设计语言Datasheet的一个片段,它用来描述L语言中所有的约束满足问题。因此,开发工具,帮助我们了解是否可以在对称数据库中定义CSP是一项重要的任务。众所周知,当且仅当CSP分别具有有界树宽和有界路径宽度二元性时,CSP才可以在Datlog和线性Datlog中定义。在对称的Datatov的情况下,Bulatov,Krokhin和Larose要求这样的对偶性(2008)。我们提供了两个这样的对偶,并给出应用。特别地,我们给出了Dalmau和Larose的结果“Maltsev + Dataret-> symmetric Dataret”(2008)的一个简短的新证明。在论文的第二部分中,我们为Dalmau(2002)的猜想提供了一些证据,即NL中的每个CSP都可以在线性数据集中定义。我们的结果还表明,一类广泛的CSPs-CSP,不具有有界路宽对偶(例如,P-完全Horn-3Sat问题)-不能由任何多项式大小的单调只读非确定性分支程序族来定义。

英文摘要:

Symmetric Datalog, a fragment of the logic programming language Datalog, is conjectured to capture all constraint satisfaction problems (CSP) in L. Therefore developing tools that help us understand whether or not a CSP can be defined in symmetric Datalog is an important task. It is widely known that a CSP is definable in Datalog and linear Datalog if and only if that CSP has bounded treewidth and bounded pathwidth duality, respectively. In the case of symmetric Datalog, Bulatov, Krokhin and Larose ask for such a duality (2008). We provide two such dualities, and give applications. In particular, we give a short and simple new proof of the result of Dalmau and Larose that "Maltsev + Datalog -> symmetric Datalog" (2008). In the second part of the paper, we provide some evidence for the conjecture of Dalmau (2002) that every CSP in NL is definable in linear Datalog. Our results also show that a wide class of CSPs-CSPs which do not have bounded pathwidth duality (e.g., the P-complete Horn-3Sat problem)-cannot be defined by any polynomial size family of monotone read-once nondeterministic branching programs.

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

↑