Proof-Carrying Plans: a Resource Logic for AI Planning

Proof-Carrying Plans: a Resource Logic for AI Planning
复制标题

证明承载计划:AI 规划的资源逻辑

DOI:
10.1145/3414080.3414094
复制
发表时间:
2020
期刊:
--
影响因子:
--
通讯作者:
Hill A
Hill A
中科院分区:
--
文献类型:
--
作者:
Hill A

文献摘要

参考文献

被引文献

相似文献

规划语言已经在人工智能中成功使用了几十年。人工智能验证和可解释人工智能的最新趋势提出了人工智能规划技术是否可以验证的问题。在本文中,我们提出了一种新的资源逻辑,证明携带计划(PCP)的逻辑,可用于验证人工智能规划者产生的计划。PCP逻辑从现有的资源逻辑(如线性逻辑和分离逻辑)以及Hoare逻辑中获得灵感,用于建模状态和资源感知计划执行。它还利用了Curry-Howard的逻辑方法,将计划作为函数处理,将计划的前置条件和后置条件作为类型处理。本文提出了两个主要结果。从理论的角度来看,我们表明,PCP逻辑是健全的相对于标准的可能世界的语义在AI规划。从实用的角度来看,我们提出了一个完整的Agda形式化的PCP逻辑和其合理性证明。此外,我们展示了Curry-Howard,或功能,这个实现的价值,补充它的库,自动解析AI计划到Agda的证明。我们提供了这个库和由此产生的Agda功能的评价。关键词:人工智能规划,验证,资源逻辑,定理证明,依赖类型。
Planning languages have been used successfully in AI for several decades. 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. Keywords: AI planning, Verification, Resource Logics, Theorem Proving, Dependent Types.
作为定理证明的经典人工智能规划:线性逻辑片段的案例
DOI: --
发表时间: 1993
期刊:
影响因子: --
作者:
Éric Jacopin
通讯作者: Éric Jacopin
一种经过验证的人工智能规划组合算法
DOI: --
发表时间: 2019
期刊: International Conference on Interactive Theorem Proving
影响因子: --
作者:
Mohammad Abdulaziz;Charles Gretton;Michael Norrish
通讯作者: Michael Norrish
证明相关的核心递归解析
DOI: --
发表时间: 2015
期刊: Fuji International Symposium on Functional and Logic Programming
影响因子: --
作者:
Peng Fu;Ekaterina Komendantskaya;Tom Schrijvers;Andrew Pond
通讯作者: Andrew Pond
认知轮子:人工智能的框架问题
DOI: --
发表时间: --
期刊:
影响因子: --
作者:
D. Wilkins
通讯作者: D. Wilkins
CompCert C 验证编译器
DOI: --
发表时间: 2015
期刊:
影响因子: --
作者:
X. Leroy;Inria Paris
通讯作者: Inria Paris