集规划的集宽度和有向宽度度量
Clique-Width and Directed Width Measures for Answer-Set Programming
摘要：
析取答案集编程（ASP）是一种功能强大的声明式编程范式，其主要决策问题位于多项式层次结构的第二层。识别易处理的片段和开发有效的算法，这样的片段，因此，重要的目标，以补充先进的ASP系统可用。如果某个问题的参数被固定的常数限制，那么困难的问题可以变得易处理;这样的问题被称为固定参数易处理（FPT）。虽然有几个FPT的ASP结果存在，参数，涉及到有向图或签署的代表手头的程序已经被忽略了。在本文中，我们首先给出了一些负面的意见表明，有向宽度措施的依赖图的程序不会导致FPT的结果。在此基础上，考虑图的符号宽度参数，提出了一种新的动态规划算法FPT w.r.t.这个参数。cnum-width比著名的treewide更一般，而且，据我们所知，我们是第一个FPT算法的有界cnum-width超越SAT推理问题。
英文摘要：
Disjunctive Answer Set Programming (ASP) is a powerful declarative programming paradigm whose main decision problems are located on the second level of the polynomial hierarchy. Identifying tractable fragments and developing efficient algorithms for such fragments are thus important objectives in order to complement the sophisticated ASP systems available to date. Hard problems can become tractable if some problem parameter is bounded by a fixed constant; such problems are then called fixed-parameter tractable (FPT). While several FPT results for ASP exist, parameters that relate to directed or signed graphs representing the program at hand have been neglected so far. In this paper, we first give some negative observations showing that directed width measures on the dependency graph of a program do not lead to FPT results. We then consider the graph parameter of signed clique-width and present a novel dynamic programming algorithm that is FPT w.r.t. this parameter. Clique-width is more general than the well-known treewidth, and, to the best of our knowledge, ours is the first FPT algorithm for bounded clique-width for reasoning problems beyond SAT.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
