Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorBotta, Nicola
dc.contributor.authorJansson, Patrik
dc.contributor.authorIonescu, Cezar
dc.contributor.authorChristiansen, David
dc.contributor.authorBrady, Edwin Charles
dc.date.accessioned2017-04-28T11:30:13Z
dc.date.available2017-04-28T11:30:13Z
dc.date.issued2017-03-17
dc.identifier.citationBotta , N , Jansson , P , Ionescu , C , Christiansen , D & Brady , E C 2017 , ' Sequential decision problems, dependent types and generic solutions ' , Logical Methods in Computer Science , vol. 13 , no. 1 , 7 . https://doi.org/10.23638/LMCS-13(1:7)2017en
dc.identifier.issn1860-5974
dc.identifier.otherPURE: 246979433
dc.identifier.otherPURE UUID: ad0d5fc7-c663-4247-ae3e-1fb18b9608a4
dc.identifier.otherScopus: 85041811376
dc.identifier.otherORCID: /0000-0002-9734-367X/work/58054925
dc.identifier.otherWOS: 000418916500015
dc.identifier.urihttps://hdl.handle.net/10023/10681
dc.description.abstractWe present a computer-checked generic implementation for solving finite horizon sequential decision problems. This is a wide class of problems, including intertemporal optimizations, knapsack, optimal bracketing, scheduling, etc. The implementation can handle time-step dependent control and state spaces, and monadic representations of uncertainty (such as stochastic, non-deterministic, fuzzy, or combinations thereof). This level of genericity is achievable in a programming language with dependent types (we have used both Idris and Agda). Dependent types are also the means that allow us to obtain a formalization and computer-checked proof of the central component of our implementation: Bellman’s principle of optimality and the associated backwards induction algorithm. The formalization clarifies certain aspects of backwards induction and, by making explicit notions such as viability and reachability, can serve as a starting point for a theory of controllability of monadic dynamical systems, commonly encountered in, e.g., climate impact research.
dc.format.extent23
dc.language.isoeng
dc.relation.ispartofLogical Methods in Computer Scienceen
dc.rightsCopyright the Authors 2017. This work is licensed under the Creative Commons Attribution-NoDerivs License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nd/2.0/en
dc.subjectBC Logicen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subjectT-NDASen
dc.subjectBDCen
dc.subjectR2Cen
dc.subjectSDG 13 - Climate Actionen
dc.subject.lccBCen
dc.subject.lccQA75en
dc.titleSequential decision problems, dependent types and generic solutionsen
dc.typeJournal articleen
dc.description.versionPublisher PDFen
dc.contributor.institutionUniversity of St Andrews. School of Computer Scienceen
dc.identifier.doihttps://doi.org/10.23638/LMCS-13(1:7)2017
dc.description.statusPeer revieweden
dc.identifier.urlhttps://lmcs.episciences.org/3202en


This item appears in the following Collection(s)

Show simple item record