arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.04165cs.LOcs.AIcs.PL
收藏

证明-携带计划:AI计划的资源逻辑

Proof-Carrying Plans: a Resource Logic for AI Planning

Heriot-Watt University(赫瑞-瓦特大学)

Alasdair Hill, Ekaterina Komendantskaya, Ronald P. A. Petrick

摘要:

人工智能验证和可解释人工智能的最新趋势提出了人工智能规划技术是否可以验证的问题。在本文中,我们提出了一种新的资源逻辑,证明携带计划(PCP)的逻辑,可用于验证人工智能规划者产生的计划。PCP逻辑从现有的资源逻辑(如线性逻辑和分离逻辑)以及霍尔逻辑中获得灵感,当涉及到建模状态和资源感知计划执行时。它还利用了Curry-Howard的逻辑方法,将计划作为函数处理,将计划的前置条件和后置条件作为类型处理。本文提出了两个主要结果。从理论的角度来看,我们表明,PCP逻辑是健全的相对于标准的可能世界的语义在AI规划。从实用的角度来看,我们提出了一个完整的Agda形式化的PCP逻辑和其合理性证明。此外,我们通过补充将人工智能计划自动解析为Agda证明的库来展示该实现的Curry-Howard或功能价值。我们提供了这个库和由此产生的Agda功能的评价。

英文摘要:

Recent trends in AI verification and Explainable AI have raised the question of whether AI planning techniques can be verified. In this paper, we present a novel resource logic, the Proof Carrying Plans (PCP) logic that can be used to verify plans produced by AI planners. The PCP logic takes inspiration from existing resource logics (such as Linear logic and Separation logic) as well as Hoare logic when it comes to modelling states and resource-aware plan execution. It also capitalises on the Curry-Howard approach to logics, in its treatment of plans as functions and plan pre- and post-conditions as types. This paper presents two main results. From the theoretical perspective, we show that the PCP logic is sound relative to the standard possible world semantics used in AI planning. From the practical perspective, we present a complete Agda formalisation of the PCP logic and of its soundness proof. Moreover, we showcase the Curry-Howard, or functional, value of this implementation by supplementing it with the library that parses AI plans into Agda's proofs automatically. We provide evaluation of this library and the resulting Agda functions.

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

↑