Sciweavers

504 search results - page 2 / 101
» Complexity Properties of Restricted Abstract Argument System...
Sort
View
ECAI
2008
Springer
13 years 6 months ago
Theoretical and Computational Properties of Preference-based Argumentation
During the last years, argumentation has been gaining increasing interest in modeling different reasoning tasks of an agent. Many recent works have acknowledged the importance of ...
Yannis Dimopoulos, Pavlos Moraitis, Leila Amgoud
COGSCI
2004
82views more  COGSCI 2004»
13 years 4 months ago
Restricting grammatical complexity
of natural language syntax often characterize grammatical knowledge as a form of abstract computation. This paper argues that such a characterization is correct, and that fundamen...
Robert Frank
ECSQARU
2007
Springer
13 years 11 months ago
Towards an Extensible Argumentation System
Many types of inter-agent dialogue, including information seeking, negotiation and deliberation can be fruitfully seen as varieties of argumentation. Argumentation frameworks, ori...
Adam Zachary Wyner, Trevor J. M. Bench-Capon
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
13 years 11 months ago
Perfect NIZK with Adaptive Soundness
Abstract. This paper presents a very simple and efficient adaptivelysound perfect NIZK argument system for any NP-language. In contrast to recently proposed schemes by Groth, Ostro...
Masayuki Abe, Serge Fehr
ACL
1998
13 years 6 months ago
Generating the Structure of Argument
This paper demonstrates that generating arguments in natural language requires at an abstract level, and that the ate abstraction cannot be captured by approaches based solely upo...
Chris Reed, Derek Long