Sciweavers

1187 search results - page 23 / 238
» Computation in Extended Argumentation Frameworks
Sort
View
KI
2008
Springer
13 years 8 months ago
Can Argumentation Help AI to Understand Explanation?
ed from context by seeing an explanation inferentially, much in the same way that early expert systems saw an explanation as chaining of inferences. This approach omitted, for the ...
Doug Walton
COMMA
2010
13 years 3 months ago
Generalizing stable semantics by preferences
Different proposals have been made in the literature for refining Dung's argumentation framework by preferences between arguments. The idea is to ignore an attack if the atta...
Leila Amgoud, Srdjan Vesic
CCIA
2005
Springer
14 years 2 months ago
On Warranted Inference in Possibilistic Defeasible Logic Programming
Abstract. Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating...
Carlos Iván Chesñevar, Guillermo Ric...
VLDB
1987
ACM
104views Database» more  VLDB 1987»
13 years 12 months ago
Magic Functions: A Technique to Optimize Extended Datalog Recursive Programs
Severalmethodshavebeenproposedto compile recursive Datalog programs. The most well-known perform a rewriting of rules using MAGIC or PROBLEM predicates in order to push selections...
Georges Gardarin
AI
2002
Springer
13 years 8 months ago
Coherence in finite argument systems
Systems provide a rich abstraction within which divers concepts of reasoning, acceptability and defeasibility of arguments, etc., may be studied using a unified framework. Two imp...
Paul E. Dunne, Trevor J. M. Bench-Capon