量词模态逻辑的代数语义学（Ⅲ）──关于不含Barcan公式的正规模态系统的情形

本文首先讨论嵌套论域语义的相应代数语义并由Ｈｕｇｈｅｓ和Ｃｒｅｓｓｗｅｌｌ在［５］中建立的关于具有嵌套论域的正规量词模态系统的关系语义完全性定理推出其相应的代数语义完全性定理：然后对于具有任意可变论域语义的正规系统，我们用Ｈｅｎｋｉｎ方法给出其关于狭义Ｋｒｉｐｋｅ语义的关系语义完全性定理，由此通过将关系语义转化为代数语义从而亦推得其代数语义完全性定理。     

Iterated team semantics for a hierarchy of informational types

In this paper, we introduce and study a framework that is inspired by the team semantics for propositional dependence logic but deviates from it in several respects. Most importantly, instead of the two semantic layers used in dependence logic – possible worlds and teams – a whole hierarchy of contexts is introduced and different types of formulas are evaluated at different levels of this hierarchy. This leads to a rich stratification of informational types. In this framework, the dependence operator of dependence logic can be defined by the standard propositional connectives (negation, conjunction, disjunction and implication). We explore the formal aspects of this approach and apply it to a number of puzzling phenomena related to modalities and conditionals.     

Propositional union closed team logics

In this paper, we study several propositional team logics that are closed under unions, including propositional inclusion logic. We show that all these logics are expressively complete, and we introduce sound and complete systems of natural deduction for these logics. We also discuss the locality property and its connection with interpolation in these logics.     

Using as a Semantic Markup Format

One of the great problems of Mathematical Knowledge Management (MKM) systems is to obtain access to a sufficiently large corpus of mathematical knowledge to allow the management/search/navigation techniques developed by the community to display their strength. Such systems usually expect the mathematical knowledge they operate on in the form of semantically enhanced documents, but mathematicians and publishers in Mathematics have heavily invested into the format and workflow. We analyze the current practice of semi-semantic markup in documents and extend it by a markup infrastructure that allows to embed semantic annotations into documents without changing their visual appearance. This collection of macro packages is called (semantic ) as it allows to markup documents semantically without leaving the time-tried workflow, essentially turning into an MKM format. At the heart of is a definition mechanism for semantic macros for mathematical objects and a non-standard scoping construct for them, which is oriented at the semantic dependency relation rather than the document structure. We evaluate the macro collection on a large case study: the course materials of a two-semester course in Computer Science was annotated semantically and converted to the OMDoc MKM format by Bruce Miller’s LaTeXML system.      

Domain理论与拓扑

Ｄｏｍａｉｎ理论作为计算机程序设计语言研究的数学基础,序和拓扑的相互结合在这一领域中起着基本而重要的作用,本文力图从Ｄｏｍａｉｎ理论产生的背景,它在几个方面的发展,反映Ｄｏｍａｉｎ理论与拓扑的紧密联系,使我们看到序和拓扑的结合怎样应用于程序设计语言研究。     

信任本体的形式化语义研究

针对现有的信任模型缺少信任相关概念属性在数理上的定义以及严格可靠的信任语义推理和统一的形式化抽象模型的问题,本文提出形式化动态信任本体的概念,结合本体在语义层次的形式化描述方法,对实体信任、行为信任和区域信任进行本体化,并对三种信任本体进行形式化语义演绎和推理.给出了信任相关属性的形式化理论分析,并通过典型的激发场景实例,有效地验证了信任本体化理论.     

Dual‐Context Sequent Calculus and Strict Implication

We introduce a dual‐context style sequent calculus which is complete with respectto Kripke semantics where implication is interpreted as strict implication in the modal logic K. The cut‐elimination theorem for this calculus is proved by a variant of Gentzen's method.     

网络驱动的未识甲骨字特性及场景语义预测

甲骨学的研究具有重要的文化价值和传承意义,可以极大提高国家的文化自信。未识甲骨字的语义预测是甲骨学研究中最主要的问题,也是传统甲骨学研究中最棘手的问题。现有的计算机技术辅助研究方法无法预测未识甲骨字的语义。利用复杂网络对甲骨文进行了抽象和理解,并对未识甲骨字的场景语义进行预测。首先,以甲骨拓片为基础数据,通过建模构建甲骨字网络;其次,在甲骨字网络之上,分析未识甲骨字的重要性、信息丰富度、闭合性等特性,为预测未识甲骨字的场景语义提供理论依据;最后,根据网络特性和甲骨拓片的上下文语境预测未识甲骨字的场景语义。构建的未识甲骨字特性体系以及预测未识甲骨字的场景语义思路为破译其他未识甲骨字的语义奠定了基础,有助于推动甲骨文考释的进程。