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

线性时态逻辑的强后门

Strong Backdoors for Linear Temporal Logic

Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler

摘要:

本文针对Fisher提出的线性时态逻辑的CNF-片断,将强后门的概念引入时态逻辑领域。我们研究了以后门大小为参数的可满足性问题的参数化复杂性。我们将后门检测和后门评估区分为horn和krom公式的片段。在这里,我们对全局操作符的操作符片段进行分类,用于过去或未来,以及两者的组合。检测被证明是在FPT,而评价的复杂性表现不同。我们表明,克罗姆公式的问题是paraNP-完全的。对于喇叭公式的复杂性被证明是固定参数易处理或paraNP-完全取决于所考虑的运营商片段。

英文摘要:

In the present paper we introduce the notion of strong backdoors into the field of temporal logic for the CNF-fragment of linear temporal logic introduced by Fisher. We study the parameterised complexity of the satisfiability problem parameterised by the size of the backdoor. We distinguish between backdoor detection and evaluation of backdoors into the fragments of horn and krom formulas. Here we classify the operator fragments of globally-operators for past or future, and the combination of both. Detection is shown to be in FPT whereas the complexity of evaluation behaves different. We show that for krom formulas the problem is paraNP-complete. For horn formulas the complexity is shown to be either fixed parameter tractable or paraNP-complete depending on the considered operator fragment.

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

↑