Contributions to a computational theory of policy advice and avoidability
Artikel i vetenskaplig tidskrift, 2017

We present the starting elements of a mathematical theory of policy advice and avoidability. More specifically, we formalize a cluster of notions related to policy advice, such as policy, viability, reachability, and propose a novel approach for assisting decision making, based on the concept of avoidability. We formalize avoidability as a relation between current and future states, investigate under which conditions this relation is decidable and propose a generic procedure for assessing avoidability. The formalization is constructive and makes extensive use of the correspondence between dependent types and logical propositions, decidable judgments are obtained through computations. Thus, we aim for a computational theory, and emphasize the role that computer science can play in global system science.

Författare

Nicola Botta

Patrik Jansson

Funktionell programmering

Cezar Ionescu

Programvaruteknik

Journal of Functional Programming

0956-7968 (ISSN) 1469-7653 (eISSN)

Vol. 27 1-52

Styrkeområden

Informations- och kommunikationsteknik

Drivkrafter

Hållbar utveckling

Ämneskategorier

Data- och informationsvetenskap

Datavetenskap (datalogi)

Fundament

Grundläggande vetenskaper

DOI

10.1017/S0956796817000156