找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Logic, Rationality,and Interaction; 8th International Wo Sujata Ghosh,Thomas Icard Conference proceedings 2021 Springer Nature Switzerland

[復(fù)制鏈接]
樓主: 并排一起
41#
發(fā)表于 2025-3-28 17:31:48 | 只看該作者
Voting Theory in the Lean Theorem Prover,puter-aided methods such as SAT solving and interactive theorem proving. In this paper, we report on the development of a framework for formalizing voting theory in the Lean theorem prover, which we have applied to verify properties of a recently studied voting method. While previous applications of
42#
發(fā)表于 2025-3-28 22:00:52 | 只看該作者
43#
發(fā)表于 2025-3-29 00:53:02 | 只看該作者
44#
發(fā)表于 2025-3-29 07:01:26 | 只看該作者
A Generalization of Ordered-Pair Semantics,.. Moreover, we show that the resulting semantics can accommodate not only ., but also classical logic as well as strong Kleene logic depending on the set of designated (or distinguished) values that one chooses. Building on the technical observations, we offer intuitively plausible readings for the
45#
發(fā)表于 2025-3-29 07:55:59 | 只看該作者
Social Bot Detection as a Temporal Logic Model Checking Problem, of social bots is dominated by machine learning approaches. In this paper we explore bot detection as a model checking problem. We introduce Temporal Network Logic (TNL) which we use to specify social networks where agents can post and follow each other. In this logic we formalize different types o
46#
發(fā)表于 2025-3-29 11:38:51 | 只看該作者
Assertion, Rejection, and Semantic Universals,gated disjunction ., but no word to express negated conjunction *. nor any other Boolean connective. Natural language grammar can be described by a logic that expresses what the lexicon can express by its primitives, and the rest compositionally. Such logic for propositional connectives is described
47#
發(fā)表于 2025-3-29 16:14:14 | 只看該作者
Situated Epistemic Updates, paper we discuss representations of epistemic update in terms of situations. After linking epistemic update based on deleting epistemic accessibility arrows with update of situations, we discuss two specific kinds of public epistemic update; monotonic update in intuitionistic dynamic epistemic logi
48#
發(fā)表于 2025-3-29 21:46:21 | 只看該作者
How Knowledge Triggers Obligation,o capture the . interaction between knowledge and obligations. We introduce the dynamic extension of an existing logic for knowledge-based obligations here. We motivate the logic by analyzing several scenarios and by showing how it can capture in an original manner several fundamental deontic notion
49#
發(fā)表于 2025-3-30 03:18:55 | 只看該作者
,On Artemov and Protopopescu’s Intuitionistic Epistemic Logic Expanded with Distributed Knowledge,mic logic ., where the axiom . is accepted but the axiom . is refused. This paper studies the notion of distributed knowledge on an expansion of the multi agent variant of .. We provide a BHK interpretation of distributed knowledge operator to define the intuitionistic epistemic logic with distribut
50#
發(fā)表于 2025-3-30 04:59:03 | 只看該作者
Modelling Accuracy and Trustworthiness of Explaining Agents,nes. Such agents are naturally required to be accurate and trustworthy. However, what it means for an explaining agent to be accurate and trustworthy is far from being clear. We characterize accuracy and trustworthiness as measures of the distance between the formal properties of a given opaque syst
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-8 21:26
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
彝良县| 策勒县| 剑河县| 曲松县| 塘沽区| 河源市| 如皋市| 仲巴县| 康平县| 抚顺市| 崇文区| 凤庆县| 礼泉县| 平利县| 黑水县| 大冶市| 泾阳县| 即墨市| 抚州市| 铜山县| 商都县| 治多县| 罗平县| 安化县| 五大连池市| 兴化市| 临沧市| 唐海县| 夏邑县| 黔西| 滨州市| 宜兰县| 桂平市| 杭锦后旗| 辽源市| 通榆县| 伊通| 绥中县| 耒阳市| 宁明县| 苍溪县|