Abstract
Verification of AI is a challenge that has engineering, algorithmic and programming language components. For example, AI planners are deployed to model actions of autonomous agents. They comprise a number of searching algorithms that, given a set of specified properties, find a sequence of actions that satisfy these properties. Although AI planners are mature tools from the algorithmic and engineering points of view, they have limitations as programming languages. Decidable and efficient automated search entails restrictions on the syntax of the language, prohibiting use of higher-order properties or recursion. This paper proposes a methodology for embedding plans produced by AI planners into the dependently-typed language Agda, which enables users to reason about and verify more general and abstract properties of plans, and also provides a more holistic programming language infrastructure for modelling plan execution.
Original language | English |
---|---|
Title of host publication | TyDe 2021: Proceedings of the 6th ACM SIGPLAN International Workshop on Type-Driven Development |
Editors | Hsiang-Shang Ko, Dominic Orchard |
Publisher | Association for Computing Machinery |
Pages | 1-13 |
Number of pages | 13 |
ISBN (Electronic) | 9781450386166 |
DOIs | |
Publication status | Published - 18 Aug 2021 |
Event | 6th ACM SIGPLAN International Workshop on Type-Driven Development 2021 - Virtual, Online, Korea, Republic of Duration: 22 Aug 2021 → … |
Conference
Conference | 6th ACM SIGPLAN International Workshop on Type-Driven Development 2021 |
---|---|
Abbreviated title | TyDe 2021 |
Country/Territory | Korea, Republic of |
City | Virtual, Online |
Period | 22/08/21 → … |
Keywords
- AI Planners
- Dependent Types
- Verification
ASJC Scopus subject areas
- Computer Science Applications
- Software