Sequential decision problems, dependent types and generic solutions
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 s...
Main Authors: | Nicola Botta, Patrik Jansson, Cezar Ionescu, David R. Christiansen, Edwin Brady |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2017-03-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/3191/pdf |
Similar Items
-
Sequential Relational Decomposition
by: Dror Fried, et al.
Published: (2022-03-01) -
Generic algorithms for halting problem and optimal machines revisited
by: Laurent Bienvenu, et al.
Published: (2016-04-01) -
Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence
by: Thorsten Wißmann, et al.
Published: (2022-11-01) -
Decision problems for linear recurrences involving arbitrary real numbers
by: Eike Neumann
Published: (2021-08-01) -
Quantitative information flow under generic leakage functions and adaptive adversaries
by: M. Boreale, et al.
Published: (2015-11-01)