再论有界度的自动结构

有界线性逻辑

Bounded Linear Logic, Revisited

我们提出QBAL，Girard，Scedrov和Scott的有界线性逻辑的扩展。该系统的主要新颖之处是量化资源变量的可能性。这种推广使得有界线性逻辑更加灵活，同时在多项式时间内保持可靠性和完备性。特别是，我们提供了合成嵌入Leivant的RRW和霍夫曼的LFPL到QBAL。

Finite Model Theory and Proof Complexity revisited: Distinguishing graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus

This paper extends prior work on the connections between logics from finite model theory and propositional/algebraic proof systems. We show that if all non-isomorphic graphs in a given graph class can be distinguished in the logic Choiceless Polynomial Time with counting (CPT), then they can also be distinguished in the bounded-degree extended polynomial calculus (EPC), and the refutations have roughly the same size as the resource consumption of the CPT-sentence. This allows to transfer lower bounds for EPC to CPT and thus constitutes a new potential approach towards better understanding the …

再论有界树宽的答案集求解

Answer Set Solving with Bounded Treewidth Revisited

参数化算法是一种更有效地解决困难问题的方法，因为输入的特定参数很小。本文将这一思想应用于答案集编程领域。为此，我们提出了两种图形表示的程序，利用其树宽作为参数。树宽大致衡量程序的内部结构在多大程度上类似于树。我们的主要贡献是设计参数化的动态规划算法，它运行在线性时间，如果给定的程序的树宽和权重是有界的。与以前的工作相比，我们的算法处理的ASP。最后，我们报告的实证评估，表现出良好的运行时行为的基准实例的低树宽，特别是计数的答案集。

指针程序的有界模型检验

Bounded Model Checking of Pointer Programs Revisited

指针程序的有界模型检验是一种调试技术，用于操作堆上动态分配的指针结构的程序。它基于以下四点意见。第一，错误条件（如悬空指针的解引用）可以用双变量一阶逻辑的~片段来表示。其次，片段在最弱的前提条件wrt下是封闭的。有限路径第三，数据结构，如树、列表等，可以通过在数据库片段中定义的归纳谓词来表达。最后，双变量逻辑和数据库的两个片段的组合是可判定的。在本文中，我们通过扩展底层逻辑的表达能力来改进这种技术。在~序列的例子中，我们证明了新的逻辑是能够建模更复杂的数据结构与更复杂的依赖堆和更复杂的分析。

再论路径宽度上的一阶逻辑

First Order Logic on Pathwidth Revisited Again

研究有界路径宽度图上一阶逻辑可表达性质的可判定性，证明其具有初等依赖，与树宽度情况形成对比。

Regular Model Checking Revisited (Technical Report)

In this contribution we revisit regular model checking, a powerful framework that has been successfully applied for the verification of infinite-state systems, especially parameterized systems (concurrent systems with an arbitrary number of processes). We provide a reformulation of regular model checking with length-preserving transducers in terms of existential second-order theory over automatic structures. We argue that this is a natural formulation that enables us tap into powerful synthesis techniques that have been extensively studied in the software verification community. More precisely…