A computational theory of normative positions (2001)
| Venue: | ACM Transactions on Computational Logic |
| Citations: | 63 - 9 self |
BibTeX
@ARTICLE{Sergot01acomputational,
author = {Marek Sergot},
title = {A computational theory of normative positions},
journal = {ACM Transactions on Computational Logic},
year = {2001},
volume = {2},
pages = {2001}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The Kanger-Lindahl theory of normative positions attempts to use a combination of deontic logic (the logic of obligation and permission) and a logic of action/agency to give a formal account of obligations, duties, rights, and other complex normative concepts. This paper presents a generalisation and further development of this theory, together with methods for its automation and application to practical examples. The resulting theory is intended to be applied in the representation and analysis of laws, regulations, and contracts, in the specification of aspects of computer systems, in multi-agent systems, and as a contribution to the formal theory of organisations. Particular attention is paid to representations at varying levels of detail and the relationships that hold between them. The last part presents Norman-G, an automated support system intended to facilitate application of the theory to the analysis of practical problems, with a small example to illustrate its use.
Keyphrases
normative position computational theory practical problem normative position attempt small example deontic logic support system particular attention formal account computer system complex normative concept action agency practical example kanger-lindahl theory multi-agent system formal theory last part
