CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Contributions to a computational theory of policy advice and avoidability

Nicola Botta ; Patrik Jansson (Institutionen för Data- och informationsteknik, Funktionell programmering (Chalmers)) ; Cezar Ionescu (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers))
Journal of functional programming (0956-7968). Vol. 27 (2017), p. 1-52.
[Artikel, refereegranskad vetenskaplig]

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.



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2017-11-19. Senast ändrad 2017-11-21.
CPL Pubid: 253248

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)