A logic-based theory of deductive arguments
Artificial Intelligence
Defeasible logic programming: an argumentative approach
Theory and Practice of Logic Programming
Argumentation and the Dynamics of Warranted Beliefs in Changing Environments
Autonomous Agents and Multi-Agent Systems
Argumentation in artificial intelligence
Artificial Intelligence
On principle-based evaluation of extension-based argumentation semantics
Artificial Intelligence
Mass argumentation and the semantic web
Web Semantics: Science, Services and Agents on the World Wide Web
A constrained argumentation system for practical reasoning
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
A Game-Theoretic Measure of Argument Strength for Abstract Argumentation
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Dynamics in Argumentation with Single Extensions: Abstraction Principles and the Grounded Extension
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Computational properties of resolution-based grounded semantics
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Dialectical abstract argumentation: a characterization of the marking criterion
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A Dynamic Argumentation Framework
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
Computing dialectical trees efficiently in possibilistic defeasible logic programming
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Using argument strength for building dialectical bonsai
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
Argumentation in AI provides an inconsistency-tolerant formalism capable of establishing those pieces of knowledge that can be warranted despite having information in contradiction. Computation of warrant tends to be expensive; in order to alleviate this issue, we propose a heuristics-based pruning technique over dialectical trees. Empirical testing shows that in most cases our approach answers queries much faster than the usual techniques, which prune with no guide.