×
We call the resulting formalism the proof-carrying plan logic (or PCP logic for short). It features: Hoare triples to describe plans and states; the frame rule for local resource-aware reasoning; and the Curry-Howard view on states as types, and state transformations as functions.
Oct 28, 2020 · We call the resulting formalism the proof- carrying plan logic (or PCP logic for short). It features: Hoare triples to describe plans and states ...
People also ask
Aug 10, 2020 · 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.
Sep 21, 2020 · 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.
Dec 19, 2018 · In this paper, we show that this method can itself be verified. We present a formal framework and a prototype Agda implementation that represent PDDL plans as ...
We present a formal framework and a prototype Agda implementation that represent PDDL plans as executable functions that inhabit types that are given by ...
Proof-Carrying Plans Overview. This repository contains all versions of the inference systems created for the submission of the PhD: Planning Problems as ...
Proof-carrying code (PCC) is a software mechanism that allows a host system to verify properties about an application via a formal proof that accompanies ...
Missing: Plans. | Show results with:Plans.
By exploiting the well-known Curry-Howard correspondence, type-checking then automatically ensures that the generated program corresponds precisely to the ...