37 search results - page 4 / 8 » On the computational complexity of assumption-based argument... |
ASP
2003
Springer
14 years 21 days ago
2003
Springer
Default logic is used to describe regular behavior and normal properties. We suggest to exploit the framework of default logic for detecting outliers - individuals who behave in a...
KR
2000
Springer
13 years 11 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...
KER
2008
13 years 7 months ago
2008
This article surveys existing practical implementations of both defeasible and argumentationbased reasoning engines and associated literature. We aim to summarise the current stat...
ECSQARU
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conï¬...
KI
2009
Springer
14 years 2 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 ...