Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-14T07:33:08.395Z Has data issue: false hasContentIssue false

Contributions to a computational theory of policy advice and avoidability*

Published online by Cambridge University Press:  24 October 2017

NICOLA BOTTA
Affiliation:
Transdisciplinary Concepts and Methods - Research Domain 4, Potsdam Institute for Climate Impact Research, Potsdam, Germany (e-mail: botta@pik-potsdam.de)
PATRIK JANSSON
Affiliation:
Computer Science and Engineering, Chalmers University of Technology & University of Gothenburg, Göteborg, Sweden. (e-mail: patrikj@chalmers.se, cezar@chalmers.se)
CEZAR IONESCU
Affiliation:
Computer Science and Engineering, Chalmers University of Technology & University of Gothenburg, Göteborg, Sweden. (e-mail: patrikj@chalmers.se, cezar@chalmers.se)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Articles
Copyright
Copyright © Cambridge University Press 2017 
Submit a response

Discussions

No Discussions have been published for this article.