Deutsch
 
Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

 
 
DownloadE-Mail
  Sequential decision problems, dependent types and generic solutions

Botta, N., Jansson, P., Ionescu, C., Christiansen, D. R., Brady, E. (2017): Sequential decision problems, dependent types and generic solutions. - Logical Methods in Computer Science, 13, 1 (lmcs:3202).
https://doi.org/10.23638/LMCS-13(1:7)2017

Item is

Dateien

einblenden: Dateien
ausblenden: Dateien
:
1610.07145.pdf (Verlagsversion), 359KB
Name:
1610.07145.pdf
Beschreibung:
-
Sichtbarkeit:
Öffentlich
MIME-Typ / Prüfsumme:
application/pdf / [MD5]
Technische Metadaten:
Copyright Datum:
-
Copyright Info:
-
Lizenz:
-

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Botta, Nicola1, Autor              
Jansson, P.2, Autor
Ionescu, C.2, Autor
Christiansen, D. R.2, Autor
Brady, E.2, Autor
Affiliations:
1Potsdam Institute for Climate Impact Research, ou_persistent13              
2External Organizations, ou_persistent22              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: We present a computer-checked generic implementation for solving finite-horizon sequential decision problems. This is a wide class of problems, including inter-temporal 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.

Details

einblenden:
ausblenden:
Sprache(n):
 Datum: 2017
 Publikationsstatus: Final veröffentlicht
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: Expertenbegutachtung
 Identifikatoren: DOI: 10.23638/LMCS-13(1:7)2017
PIKDOMAIN: Transdisciplinary Concepts & Methods - Research Domain IV
eDoc: 7311
Model / method: Decision Theory
Model / method: Open Source Software
Model / method: Research Software Engineering (RSE)
Organisational keyword: RD4 - Complexity Science
Working Group: Computational Methods and Visualisation
 Art des Abschluß: -

Veranstaltung

einblenden:

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Logical Methods in Computer Science
Genre der Quelle: Zeitschrift, SCI, Scopus, oa
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: -
Seiten: - Band / Heft: 13 (1 (lmcs:3202)) Artikelnummer: - Start- / Endseite: - Identifikator: Anderer: International Federation for Computational Logic (IFCoLog)
Anderer: TU Braunschweig, Institut fuer Theoretische Informatik
Anderer: 1860-5974
CoNE: https://publications.pik-potsdam.de/cone/journals/resource/logical-methods-computer-science