arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.24865cs.LOmath.LO
收藏

双阈值概率认知价值逻辑

A Dual-Threshold Probabilistic Knowing Value Logic

School of Computer and Information Engineering (School of Artificial Intelligence), Henan Normal University(河南师范大学计算机与信息工程学院(人工智能学院))

Shanxia Wang

AI总结:

本文提出双阈值概率认知价值逻辑,用于不确定多智能体场景,结合概率阈值态度与高置信度价值态度,解决概率质量分配与价值敏感约束的联合实现问题。

摘要:

我们引入一种双阈值概率认知价值逻辑,用于不确定多智能体设置。该框架在单一形式化体系中捕捉对命题的概率阈值态度和对术语值的高置信度态度,从而将概率认知逻辑与经典认知价值逻辑连接起来。特别受到隐私敏感场景的启发,在这种场景中,攻击者可能对候选敏感值分配高后验概率,但无法保证其真实。主要思想是分离命题和价值导向操作符的阈值域。虽然$K_i^θ$在完整的有理阈值区间内变化,而认知价值操作符$Kv_i^η(t)$被限制在$(\ rac{1}{2},1]$。这种高阈值限制有结构影响:一旦$η>\ rac{1}{2}$,两个不同的值无法同时满足阈值,因此唯一性自动成立。在具有可数可加测度的概率模型中,$Kv_i^η(t)$被解释为非事实性的高置信度价值锁定。我们为该框架建立了声学公理系统,并开发了基于类型空间分布和分配-配置映射的两层构造。这解决了概率质量分配与价值敏感约束的联合实现问题,并产生了一个结构化的弱完备性定理,适用于高阈值片段。

英文摘要:

We introduce a dual-threshold probabilistic knowing value logic for uncertain multi-agent settings. The framework captures within a single formalism both probabilistic-threshold attitudes toward propositions and high-confidence attitudes toward term values, thereby connecting probabilistic epistemic logic with classical knowing value logic. It is especially motivated by privacy-sensitive scenarios in which an attacker assigns high posterior probability to a candidate sensitive value without guaranteeing that it is the true one. The main idea is to separate the threshold domains of propositional and value-oriented operators. While $K_i^θ$ ranges over the full rational threshold interval, the knowing-value operator $Kv_i^η(t)$ is restricted to $(\frac{1}{2},1]$. This high-threshold restriction has a structural effect: once $η>\frac{1}{2}$, two distinct values cannot both satisfy the threshold, so uniqueness becomes automatic. Over probabilistic models with countably additive measures, $Kv_i^η(t)$ is interpreted as non-factive high-confidence value locking. We establish sound axiomatic systems for the framework and develop a two-layer construction based on type-space distributions and assignment-configuration mappings. This resolves the joint realization problem arising from probabilistic mass allocation and value-sensitive constraints, and yields a structured weak-completeness theorem for the high-threshold fragment.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑