局部分层约束逻辑程序的转换规则

规则如何表示因果知识：用概率逻辑编程进行因果建模

How Rules Represent Causal Knowledge: Causal Modeling with Probabilistic Logic Programming

研究如何将珀尔的因果方法引入概率逻辑编程，通过与不依赖时间概念的哲学基础对齐，提出形式因果语义等，使其语义与分层ProbLog程序的P-log语义一致，解决因果知识在不同形式主义中的应用问题。

The Intricacies of 3-Valued Extensional Semantics for Higher-Order Logic Programs

In (Bezem 1999; Bezem 2001), M. Bezem defined an extensional semantics for positive higher-order logic programs. Recently, it was demonstrated in (Rondogiannis and Symeonidou 2016) that Bezem's technique can be extended to higher-order logic programs with negation, retaining its extensional properties, provided that it is interpreted under a logic with an infinite number of truth values. In (Rondogiannis and Symeonidou 2017) it was also demonstrated that Bezem's technique, when extended under the stable model semantics, does not in general lead to extensional stable models. In this paper we co…

Program Verification via Predicate Constraint Satisfiability Modulo Theories

This paper presents a verification framework based on a new class of predicate Constraint Satisfaction Problems called pCSP where constraints are represented as clauses modulo first-order theories over function variables and predicate variables that may represent well-founded predicates. The verification framework generalizes an existing one based on Constrained Horn Clauses (CHCs) to arbitrary clauses, function variables, and well-foundedness constraints. While it is known that the satisfiability of CHCs and the validity of queries for Constrained Logic Programs (CLP) are inter-reducible, we …

高阶逻辑程序的稳定模型语义

The Stable Model Semantics for Higher-Order Logic Programming

本文基于近似不动点理论，为高阶逻辑程序提出稳定模型语义，推广经典二值与三值语义，并定义分层程序类，证明其唯一稳定模型与良基语义一致，为新型ASP系统奠定基础。

Abstraction Logic: The Marriage of Contextual Refinement and Separation Logic

Contextual refinement and separation logics are successful verification techniques that are very different in nature. First, the former guarantees behavioral refinement between a concrete program and an abstract program while the latter guarantees safety of a concrete program under certain conditions (expressed in terms of pre and post conditions). Second, the former does not allow any assumption about the context when locally reasoning about a module while the latter allows rich assumptions. In this paper, we present a new verification technique, called abstraction logic (AL), that inherently…

因果过去逻辑用于分布式大语言模型代理工作流的运行时验证

Causal Past Logic for Runtime Verification of Distributed LLM Agent Workflows

本文提出了一种因果过去逻辑（CPL）用于分布式大语言模型代理工作流的运行时验证，通过在ZipperGen框架中引入CPL，实现了对工作流中因果可见事件的实时监控和控制流影响，从而将运行时验证整合到协调语言本身。