| An executable specification of an argumentation protocol |
| Full text |
Pdf
(212 KB)
|
| Source
|
International Conference on Artificial Intelligence and Law
archive
Proceedings of the 9th international conference on Artificial intelligence and law
table of contents
Scotland, United Kingdom
SESSION: Argumentation
table of contents
Pages: 1 - 11
Year of Publication: 2003
ISBN:1-58113-747-8
|
|
Authors
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 2, Downloads (12 Months): 22, Citation Count: 7
|
|
|
ABSTRACT
Open multi-agent computational systems are composed of heterogeneous and possibly antagonistic software entities. Characteristic features are limited trust and unpredictable behaviour. Members of such systems may fail to, or even choose not to, conform to the norms governing their interactions. It has been argued that systems of this type should have a formal, declarative, verifiable, and meaningful semantics. We present a theoretical and computational framework being developed for the executable specification of such systems. We adopt an external perspective and view open computational systems as instances of normative systems. In this paper we demonstrate how the framework can be applied to specifying and executing an argumentation protocol based on Brewka's reconstruction of Rescher's theory of formal disputation. The specification is formalised in the action language C+ and executed using the 'Causal Calculator' (CCALC) implementation.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
A. Artikis, M. Sergot, and J: Pitt. Specifying electronic societies with the Causal Calculator. In Proceedings of Workshop on Agent-Oriented Software Engineering III (AOSE), LNCS 2585. Springer, 2003.
|
| |
3
|
G. Brewka. Dynamic argument systems: A formal model of argumentation processes based on situation calculus. Journal of Logic and Computation, 11(2): 257--282, 2001.
|
| |
4
|
|
| |
5
|
|
| |
6
|
|
| |
7
|
E. Giunchiglia, J. Lee, V. Lifschitz, and H. Turner. Causal laws and multi-valued fluents. In Proceedings of the Workshop on Nonmonotonic Reasoning, Action, and Change, 2001.
|
| |
8
|
|
| |
9
|
|
| |
10
|
|
| |
11
|
A. Jones and M. Sergot. A formal characterisation of institutionalised power. Journal of the IGPL, 4(3):429--445, 1996.
|
| |
12
|
Y. Moses and M. Tennenholtz. Artificial social systems. Computers and Artificial Intelligence, 14(6):533--562, 1995.
|
| |
13
|
|
| |
14
|
|
| |
15
|
N. Rescher, Dialectics: A Controversy-Oriented Approach to the Theory of Knowledge. State University of New York Press, 1977.
|
| |
16
|
M. Sergot. The language (C/C+)++. In J. Pitt, editor, Deliverable D6(2) of ALFEBIITE EÜ-Project (IST-1999--10298), pages 55--84, 2002.
|
| |
17
|
R. Smith and R. Davis. Distributed problem solving: The contract-net approach. In Proceedings of Conference of Canadian Society for Computational Studies of Intelligence, pages 217--236, 1978.
|
 |
18
|
|
CITED BY 7
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Marco Alberti , Federico Chesani , Marco Gavanelli , Evelina Lamma , Paola Mello , Marco Montali , Paolo Torroni, Expressing and Verifying Business Contracts with Abductive Logic Programming, International Journal of Electronic Commerce, v.12 n.4, p.9-38, Number 4 / Summer 2008
|
|