Sciweavers

21 search results - page 2 / 5
» Complexity of semi-stable and stage semantics in argumentati...
Sort
View
AI
2002
Springer
13 years 5 months ago
On the computational complexity of assumption-based argumentation for default reasoning
ko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, th...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
SIGSOFT
2010
ACM
13 years 3 months ago
Staged concurrent program analysis
Concurrent program verification is challenging because it involves exploring a large number of possible thread interleavings together with complex sequential reasoning. As a resul...
Nishant Sinha, Chao Wang
COGSCI
2008
139views more  COGSCI 2008»
13 years 5 months ago
A Computational Model of Early Argument Structure Acquisition
How children go about learning the general regularities that govern language, as well as keeping track of the exceptions to them, remains one of the challenging open questions in ...
Afra Alishahi, Suzanne Stevenson
DALT
2007
Springer
13 years 7 months ago
Structured Argumentation in a Mediator for Online Dispute Resolution
Online dispute resolution is becoming the main method when dealing with a conflict in e-commerce. A family of defeasible reasoning patterns is used to provide a useful link betwee...
Ioan Alfred Letia, Adrian Groza
KR
2000
Springer
13 years 8 months ago
Finding Admissible and Preferred Arguments Can be Very Hard
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni