2022年12月16-18日，“多主体系统中的逻辑”研讨会将在北京师范大学哲学学院举行。本研讨会主要关注多主体系统的三个方面：主体的能力、主体的知识、系统的规范，让研究者进行充分的交流，大家帮助大家的研究。

线下：北京师范大学前主楼A802室

线上：腾讯会议：539-3392-1985

有任何问题，欢迎您联系琚凤魁（fengkui.ju@bnu.edu.cn）。

报告人：

  1. 陈谦（清华大学哲学系）
  2. 董惠敏（中山大学哲学系(珠海)）
  3. 董淑亮（Department of Information Science and Media Studies, Bergen University）
  4. 方良达（暨南大学信息科学技术学院）
  5. 蒋军利（西南大学哲学系）
  6. 琚凤魁（北京师范大学哲学学院）
  7. 李延军（南开大学哲学系）
  8. 李尹峰（北京师范大学哲学学院）
  9. 刘婵娟（大连理工大学计算机科学与技术学院）
  10. 刘咏梅（中山大学计算机学院）
  11. 石辰威（清华大学哲学系）
  12. 孙鑫（之江实验室智能计算基础理论研究中心）
  13. 陶佳（Department of Computer Science, Lafayette College）
  14. 王彦晶（北京大学哲学系）
  15. 王奕岩（清华大学哲学系）
  16. 熊明辉（浙江大学光华法学院）
  17. 熊作军（西南大学哲学系）
  18. 许天问（浙江大学光华法学院）
  19. 俞珺华（清华大学哲学系）
  20. 张东摩（School of Computer, Data and Mathematical Sciences, Western Sydney University）

海报

日程表

本研讨会的组织者：

本研讨会受如下单位或项目支持：

================================================

报告题目、报告人和摘要：

-----------

法律信息学大要

熊明辉（浙江大学光华法学院）

法律信息学是指信息学在法律中的应用，尤其是人工智能在法律领域中的应用，属于信息科学与法学的交叉领域，但本质上属于信息学特别人工智能的一个分支，其目的是利用人工智能技术提升法治效能，通常涉及理论和应用两个方面，前者主要关注法律推理的形式模型和计算模型，而且后者则涉及自动法律推理的实现。

-----------

Logic of Preference and Functional Dependence

陈谦（清华大学哲学系）

Both of preference and dependence are key concepts in game theory. By introducing preference into the logic of functional dependence, we obtain a logic which characterises the interaction of these two concepts. In this presentation, we introduce the logic (LPFD) and its hybrid extension (HLPFD) and both of whose sound and strongly complete axiomatisation will be given. We also show that the SAT problem of LPFD is decidable, while this logic lacks the finite model property. For the proof of completeness theorem, a special kind of unraveling method is used. We show the important details, from which one may see the difference of the logic considering only interactions of preferences, the new one with dependence and its hybrid extension.

-----------

面向霍菲尔德法权的逻辑与计算

董惠敏（中山大学哲学系(珠海)）

何谓法权？如何恰当地对其形式化？本次报告将介绍一种还原论方案，刻画霍菲尔德的经典法权框架。该方案采用动态认知逻辑的工具，给出一个动态道义逻辑，以期为静态法权和动态法权建模。

-----------

Hybrid Coalition Logic (@)

董淑亮（Department of Information Science and Media Studies, Bergen University）

Coalition Logic is a modal logic for reasoning about what groups of agents can bring about strategically by collective actions. In this presentation, firstly, I will introduce the language of Hybrid Coalition Logic (@), which is obtained by adding nominals and satisfactory operator @ to the language of Coalition Logic, and then I will give the formal model of it. Secondly, I will prove that Hybrid Coalition Logic (@)+ ξ\text{Name｝ξ is strongly complete with respect to coalition models with nominals. Finally, I will add ξBG_{\emptyset｝ξ rule to Hybrid Coalition Logic (@). Then I will show Hybrid Coalition Logic (@)+ ξ\text{ξBG_{\emptyset｝ξ｝ξ + ξ\text{Name｝ξ is strongly complete with respect to truly coalition models with nominals.

-----------

Automatic Synthesis of Generalized Winning Strategies of Impartial Combinatorial Games Using SMT Solvers

方良达（暨南大学信息科学技术学院）

Strategy representation and reasoning has recently received much attention in artificial intelligence. Impartial combinatorial games (ICGs) are a type of elementary and fundamental games in game theory. One of the challenging problems of ICGs is to construct winning strategies, particularly, generalized winning strategies for possibly infinitely many instances of ICGs. In this paper, we investigate synthesizing generalized winning strategies for ICGs. To this end, we first propose a logical framework to formalize ICGs based on the linear integer arithmetic fragment of numeric part of PDDL. We then propose an approach to generating the winning formula that exactly captures the states in which the player can force to win. Furthermore, we compute winning strategies for ICGs based on the winning formula. Experimental results on several games demonstrate the effectiveness of our approach.

-----------

Complete Axiomatization of Two Fragments of Logic for Conditional Cooperative Strategic Reasoning

Valentin Goranko（Department of Philosophy, Stockholm University）、琚凤魁（北京师范大学哲学学院）、李尹峰（北京师范大学哲学学院）

Logic for Conditional Cooperative Strategic Reasoning (ConStRc) was proposed to formalize the reasoning of an external observer, about the expected choices of action of the agents based on their objectives. In this work we present complete axiomatization of its two fragments, that is, the positive and negative fragments.

-----------

数据驱动的知识与策略

蒋军利（西南大学哲学系）

随着人类社会的进步，越来越多的信息存储在数据库等外部系统中。人类和机器所知道和能做的事情依赖于对这些信息的访问，而不是个人的记忆。基于这样的现实背景，我们正式地定义和研究了这类知识和能力的性质，以数据而不是以主体为策略和知识来源，给出了一个关于知识和策略推理的逻辑系统。本次报告基于我和Pavel Naumov的合作研究。

-----------

Knowing How to Plan: Higher-order Epistemic Planning

李延军（南开大学哲学系）、王彦晶（北京大学哲学系）

In this talk, we present a powerful logical framework with local and global know-how operators. Based on the complete axiomatization and the model checking algorithm, we use this framework to do higher-order multi-agent epistemic planning with goals involving iterations of the know-how operators.

-----------

Characterization of Strategies in Games with Resource Constraints

刘婵娟（大连理工大学计算机科学与技术学院）

In this talk, I will present a game model with resource constraints and thereby a logic named LRC for such games. This logic enables the strategic reasoning of the likely strategies of the other participating entities and thus supports not only the characterization of the equilibrium of games with limited resources, but also strategic exploitation in multi-agent systems in which the available resources are restricted.

-----------

A Modal Logic for Joint Abilities under Strategy Commitments and its Epistemic Extension

刘咏梅（中山大学计算机学院）

Representation and reasoning about strategic abilities has been an active research area in AI and multi-agent systems. Many variations and extensions of alternating-time temporal logic ATL have been proposed. However, most of the logical frameworks ignore the issue of coordination within a coalition, and are unable to specify the internal structure of strategies. In this talk, I will introduce JAADL, a modal logic we recently proposed for joint abilities under strategy commitments, which is an extension of ATL. Firstly, we introduce an operator of elimination of (strictly) dominated strategies, with which we can represent joint abilities of coalitions. Secondly, our logic is based on linear dynamic logic (LDL), an extension of linear temporal logic (LTL), so that we can use regular expressions to represent commitments to structured strategies. I will present valid formulas in JAADL, give sufficient/necessary conditions for joint abilities, and show that model checking memoryless JAADL is in EXPTIME. Finally, I will introduce our epistemic extension of JAADL.

-----------

基于量子计算逻辑的投票机制

孙鑫（之江实验室智能计算基础理论研究中心）

We design four quantum voting protocols that have advantages compared to classical vote from the perspectives of both social choice and security. We adopt a step-by-step approach. We first design two primitive quantum voting protocols called quantum logical veto (QLV) and quantum logical nomination (QLN). They can be used as building blocks for the construction of more useful voting protocols, or be used independently in scenarios where classical veto-like vote and nomination-like vote are applicable. We then continue to use QLV and QLN to build another quantum voting protocol called quantum logical majority vote (QLMV), which is a generalization of the most popular voting rule that is used in reality. Finally, by combining QLMV and Condorcet vote we obtain quantum logical Condorcet vote (QLCV), which is Condorcet consistent and circumvents Arrow’s Impossibility Theorem. All these protocols are unconditionally secure. The conjunction and disjunction from quantum computational logic are used to define these protocols, which makes them relatively easy to be implemented by the current or near-future technology.

-----------

Counterfactual and Seeing-to-it Responsibilities in Strategic Games

陶佳（Department of Computer Science, Lafayette College）

In the literature, there have been two different approaches to defining responsibility. The first approach is based on what became known as Frankfurt's principle of alternate possibilities: "a person is morally responsible for what he has done only if he could have done otherwise" [1]. The principle of alternative possibilities is widely discussed in the literature and often taken as a starting point in philosophical discussions of responsibility, even though Frankfurt and many others agree that this principle has many exceptions and limitations. This principle is also referred to as "counterfactual possibility'' and is used to define causality. In this talk, for clarity, all versions of responsibility based on the principle of alternative possibilities will be referred to as counterfactual responsibility. The other approach is to hold a person responsible for the outcome if the person makes it unavoidable that the outcome happens. This approach is referred to as responsibility for seeing to it. In this talk, I will discuss these two forms of responsibility and how they are related. [1] H. G. Frankfurt, Alternate possibilities and moral responsibility, The Journal of Philosophy 66 (23) (1969) 829–839. doi:10.2307/2023833.

-----------

Collective Agency as Relational Identity

王奕岩（清华大学哲学系）

The discussion of collective agency involves the reduction problem of the concept of a collective. Individualism and Cartesian internalism have long restricted orthodox theories and made them face the tension between an irreducible concept of a collective and ontological reductionism. Heterodox theories as functionalism and interpretationism reinterpret the concept of agency and accept it as realized on the level of a collective. In order to adequately explain social phenomena that have relations as their essence, we propose a relational, holistic account of collective agency and argue that functionalism and interpretationism can be integrated into such an account.

-----------

秘密逻辑的研究进展

熊作军（西南大学哲学系）

根据报告人近年来关于秘密算子的研究，一方面从概念解释与模型构建等方面讨论秘密模态在单主体与多主体上的逻辑特征；另一方面，从极小秘密逻辑系统ICS出发，探讨其非正规性，并进一步讨论基于知识（或信念）扩张的ICS+(TD45)系统的特性与证明等。

-----------

Multi-agent Logic for Reasoning about Legal Duties and Powers

许天问（浙江大学光华法学院）、琚凤魁（北京师范大学哲学学院）

Duties, powers and some other notions definable by them such as claims are fundamental notions in private law. Duties are between agents and powers are relative to agents. In this work we present a logic for reasoning about duties and powers. The ontic level of the logic is a multi-agent dynamic logic, where agents' have abilities to change atomic facts. In the normative level, agents have powers to change duties by changing special atomic facts.

-----------

邻域模型上的含例语言：基础与变种

俞珺华（清华大学哲学系）

若函数 N 把非空集 W 中每个元素都映射到一组 W 的子集上，则称 N 为 W 上的邻域函数，并称 N(w) 中每个元素为 w 的一个邻域；称带有邻域函数和命题赋值的非空点集为邻域模型。含例邻域语言中的多类算子允许我们同时描述邻域中的全称和特称性质，从而为探索邻域模型上的逻辑开辟了更广阔的天地。本报告将介绍含例邻域语言的几个变种。

-----------

Towards a formal language for automated negotiation between autonomous vehicles

张东摩（School of Computer, Data and Mathematical Sciences, Western Sydney University）

Over the last decade, the research on autonomous vehicles (AVs) has made revolutionary progress, which brings us hope of safer, more convenient, and more efficient means of transportation. Most significantly, the advance of artificial intelligence (AI), especially machine learning, allows a self-driving car to learn and adapt to complex road situations with millions of accumulated driving hours, which are way higher than any experienced human driver can reach. However, autonomous vehicles on roads also introduce new challenges to traffic management. New theories for better understanding of the new era of transportation and new technologies for smart roadside infrastructures and intelligent traffic control are crucial for development and deployment of autonomous vehicles. This presentation will focus on an issue of how an autonomous vehicle could adapt itself to the dynamics of traffic rules. It will discuss a potential way to extend the existing game description language (GDL) towards a formal language for automated negotiation between autonomous vehicles.