Reasoning about Evolving Nonmonotonic Knowledge Bases
T. Eiter, M. Fink, G. Sabbatini, H. Tompits
备注：
47 pages.A preliminary version appeared in: Proc. 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2001), R. Nieuwenhuis and A. Voronkov (eds), pp. 407--421, LNCS 2250, Springer 2001
Recently, several approaches to updating knowledge bases modeled as extended logic programs have been introduced, ranging from basic methods to incorporate (sequences of) sets of rules into a logic program, to more elaborate methods which use an update policy for specifying how updates must be incorporated. In this paper, we introduce a framework for reasoning about evolving knowledge bases, which are represented as extended logic programs and maintained by an update policy. We first describe a formal model which captures various update approaches, and we define a logical language for expressing properties of evolving knowledge bases. We then investigate semantical and computational properties of our framework, where we focus on properties of knowledge states with respect to the canonical reasoning task of whether a given formula holds on a given evolving knowledge base. In particular, we present finitary characterizations of the evolution for certain classes of framework instances, which can be exploited for obtaining decidability results. In more detail, we characterize the complexity of reasoning for some meaningful classes of evolving knowledge bases, ranging from polynomial to double exponential space complexity.
Embedding Description Logic Programs into Default Logic
Guizhou University（贵州大学）；University of Alberta（阿尔伯塔大学）；Institute of Software, Chinese Academy of Sciences（中国科学院软件研究所）；Technische Universität Wien（维也纳工业大学）
Eiter { \em et al.}被认为是一个突出的形式主义集成规则和本体知识库。一个令人感兴趣的问题是dl程序是否可以用非单调逻辑的一般形式来描述。本文研究了在缺省逻辑中嵌入dl程序的可能性。我们证明了强和弱答案集语义下的dl-程序可以通过结合两种翻译嵌入到缺省逻辑中，其中一种翻译从非单调dl-原子中消除了约束算子，另一种翻译将dl-程序转化为缺省理论。对于没有非单调dl原子但带有否定失败算子的dl程序，我们的嵌入是多项式的、忠实的和模块化的。此外，我们的默认逻辑编码可以以一种简单的方式扩展，以捕获最近提出的弱良好支持的答案集语义，为任意的dl程序。这些结果加强了默认逻辑可以作为一个富有成效的基础查询为基础的方法，整合本体和规则的论点。缺省逻辑以其简单的语法和直观的语义，加上可用的计算结果，可以被认为是一个有吸引力的方法集成的本体和规则。
Benchmarking Defeasible Reasoning with Large Language Models -- Initial Experiments and Future Directions
School of Computing and Engineering, University of Huddersfield（哈德斯菲尔德大学计算与工程学院）；Hellenic Mediterranean University（希腊地中海大学）；Leeds Beckett University（利兹贝克特大学）
MedZERO: Self-Evolving Agents for Open-Ended Medical Reasoning Through Controlled Knowledge Accumulation
The Chinese University of Hong Kong（香港中文大学）；Zhongshan Hospital, Fudan University（复旦大学附属中山医院）；South China University of Technology（华南理工大学）；Chinese Academy of Sciences（中国科学院）
