paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Contributions to a computational theory of policy advice and avoidability

政策建议与可避免性的计算理论贡献
JFP vol.272017匹配度 2/10 · 论文属于依赖类型、构造性逻辑与决策理论的形式化工作,与用户核心关注的 LLM×静态分析/程序分析、浮点程序分析或贝叶斯程序分析几乎没有交集;仅在类型系统与形式化方法层面与 PL 背景有弱关联。引用 15 inbox
NICOLA BOTTA, PATRIK JANSSON, CEZAR IONESCU
dblp: 2026-09-10crossref: 2026-09-10

AI 速览

一句话:用依赖类型构造性地形式化政策建议、生存性、可达性与可避免性,并研究其可判定条件与通用评估过程。

本文为政策建议与可避免性问题建立计算理论的初步框架。作者将政策、生存性、可达性等概念形式化,并提出以“可避免性”为核心辅助决策的新思路:把可避免性定义为当前状态与未来状态之间的关系,考察该关系在何种条件下可判定,并给出评估可避免性的通用过程。形式化采用构造性方法,充分利用依赖类型与逻辑命题之间的对应,使可判定判断可通过计算获得。论文强调该工作属于计算理论,旨在凸显计算机科学在全球系统科学中可用于政策分析与决策支持的作用;评估以理论构造与可判定性分析为主,未涉及实证或工具实现。

问题
如何为政策建议、生存性、可达性和可避免性建立严格的数学与计算理论,并以此支持决策辅助。
方法
以构造性依赖类型理论形式化这些概念,将可避免性定义为当前与未来状态间的关系,通过计算获得可判定判断,并提出通用可避免性评估过程。
评估
对可避免性关系的可判定条件进行理论考察,并给出通用评估过程;摘要未报告实现或实证评估。
原文摘要(Abstract)

Abstract We present the starting elements of a mathematical theory of policy advice and avoidability. More specifically, we formalize a cluster of notions related to policy advice, such as policy , viability , reachability , and propose a novel approach for assisting decision making, based on the concept of avoidability . We formalize avoidability as a relation between current and future states, investigate under which conditions this relation is decidable and propose a generic procedure for assessing avoidability. The formalization is constructive and makes extensive use of the correspondence between dependent types and logical propositions, decidable judgments are obtained through computations. Thus, we aim for a computational theory, and emphasize the role that computer science can play in global system science.

链接与引用

DOI 原文 · PDF(开放获取) · DBLP

BibTeX
@article{BottaJI17,
  title = {Contributions to a computational theory of policy advice and avoidability},
  author = {NICOLA BOTTA and PATRIK JANSSON and CEZAR IONESCU},
  journal = {Journal of Functional Programming},
  volume = {27},
  year = {2017},
  doi = {10.1017/s0956796817000156}
}