Sciweavers

1094 search results - page 20 / 219
» On Computing Explanations in Argumentation
Sort
View
KSEM
2010
Springer
14 years 10 months ago
A Formalism for Causal Explanations with an Answer Set Programming Translation
We examine the practicality for a user of using Answer Set Programming (ASP) for representing logical formalisms. Our example is a formalism aiming at capturing causal explanation...
Yves Moinard
150
Voted
IBERAMIA
2010
Springer
14 years 10 months ago
A Computational Method for Defeasible Argumentation Based on a Recursive Warrant Semantics
In a recent paper [2] the authors have formalized a recursive semantics for warranted conclusions in a general defeasible argumentation framework based on a propositional logic. Th...
Teresa Alsinet, Ramón Béjar, Lluis G...
95
Voted
AI
2002
Springer
15 years 10 days 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
ATAL
2010
Springer
15 years 1 months ago
Combining statistics and arguments to compute trust
We propose a method for constructing Dempster-Shafer belief functions modeling the trust of a given agent (the evaluator) in another (the target) by combining statistical informat...
Paul-Amaury Matt, Maxime Morge, Francesca Toni
127
Voted
EXACT
2009
14 years 10 months ago
Towards the Explanation of Workflows
Across many fields involving complex computing, software systems are being augmented with workflow logging functionality. The log data can be effectively organized using declarativ...
James Michaelis, Li Ding, Deborah L. McGuinness