ACM Home Page
Please provide us with feedback. Feedback
An executable specification of an argumentation protocol
Full text PdfPdf (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
Alexander Artikis  Imperial College London, London, UK
Marek Sergot  Imperial College London, London, UK
Jeremy Pitt  Imperial College London, London, UK
Sponsors
: The Joseph Bell Centre for Forensic Statistics and Legal Reasoning
: West Group, Thomson Legal & Regulatory
: The University of Edinburgh School of Law
SIGART: ACM Special Interest Group on Artificial Intelligence
: The International Association for Artificial Intelligence and Law
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 22,   Citation Count: 7
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1047788.1047790
What is a DOI?

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

Collaborative Colleagues:
Alexander Artikis: colleagues
Marek Sergot: colleagues
Jeremy Pitt: colleagues