Formal Semantics and Formally Verified Validation for Temporal Planning

03/25/2022
by   Mohammad Abdulaziz, et al.
0

We present a simple and concise semantics for temporal planning. Our semantics are developed and formalised in the logic of the interactive theorem prover Isabelle/HOL. We derive from those semantics a validation algorithm for temporal planning and show, using a formal proof in Isabelle/HOL, that this validation algorithm implements our semantics. We experimentally evaluate our verified validation algorithm and show that it is practical.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/20/2022

Compositional Semantics and Inference System for Temporal Order based on Japanese CCG

Natural Language Inference (NLI) is the task of determining whether a pr...
research
09/12/2019

A Formal Semantics of Findel in Coq (Short Paper)

We present the first formal semantics of Findel - a DSL for specifying f...
research
12/19/2020

FraCaS: Temporal Analysis

In this paper, we propose an implementation of temporal semantics which ...
research
09/27/2019

Towards Coq-verified Esterel Semantics and Compiling

This paper focuses on semantics of the Esterel synchronous programming l...
research
10/27/2020

Formally Verified SAT-Based AI Planning

We present an executable formally verified SAT encoding of classical AI ...
research
10/11/2022

The Design and Regulation of Exchanges: A Formal Approach

We use formal methods to specify, design, and monitor continuous double ...
research
03/16/2023

Formally Verified Animation for RoboChart using Interaction Trees

RoboChart is a core notation in the RoboStar framework. It is a timed an...

Please sign up or login with your details

Forgot password? Click here to reset