7 search results - page 1 / 2 » Finding Admissible and Preferred Arguments Can be Very Hard |
KR
2000
Springer
13 years 8 months ago
2000
Springer
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...
ECAI
2006
Springer
13 years 8 months ago
2006
Springer
The fundamental operation of dominance testing, i.e., determining if one alternative is preferred to another, is in general very hard for methods of reasoning with qualitative cond...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
DPC
1996
13 years 6 months ago
1996
Retrieving images from very large collections, using image content as a key, is becoming an important problem. Users prefer to ask for pictures using notions of content that are st...
INFOCOM
2000
IEEE
13 years 8 months ago
2000
IEEE
This paper assesses the predictability of network traffic by considering two metrics: (1) how far into the future a traffic rate process can be predicted with bounded error; (2) w...