1094 search results - page 49 / 219 » On Computing Explanations in Argumentation |
APL
1998
ACM
15 years 3 months ago
1998
ACM
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...
94
Voted
COMMA
2010
14 years 5 months ago
2010
Evidence-based decision making is becoming increasingly important in many diverse domains, including healthcare, environmental management, and government. This has raised the need ...
STOC
2002
ACM
15 years 11 months ago
2002
ACM
The notion of efficient computation is usually identified in cryptography and complexity with (strict) probabilistic polynomial time. However, until recently, in order to obtain c...
95
Voted
KR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract argumentation frameworks have received a lot of interest in recent years. Most computational problems in this area are intractable but several tractable fragments have be...
107
click to vote
KI
2009
Springer
15 years 5 months ago
2009
Springer
As a tractable description logic, DL-Lite provides a good compromise between expressive power and computational complexity of inference. It is therefore important to study ways of ...