@inproceedings{fde19895ed234d9fb459eb6709959e9e,
title = "Actions you can handle: Dependent types for AI plans",
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.",
keywords = "AI Planners, Dependent Types, Verification",
author = "Alasdair Hill and Ekaterina Komendantskaya and Daggitt, {Matthew L.} and Petrick, {Ronald P.A.}",
year = "2021",
month = aug,
day = "18",
doi = "10.1145/3471875.3472990",
language = "English",
series = "TyDe 2021 - Proceedings of the 6th ACM SIGPLAN International Workshop on Type-Driven Development, co-located with ICFP 2021",
publisher = "Association for Computing Machinery (ACM)",
pages = "1--13",
editor = "Hsiang-Shang Ko and Dominic Orchard",
booktitle = "TyDe 2021 - Proceedings of the 6th ACM SIGPLAN International Workshop on Type-Driven Development, co-located with ICFP 2021",
address = "United States",
note = "6th ACM SIGPLAN International Workshop on Type-Driven Development, ICFP 2021 ; Conference date: 22-08-2021",
}