ACM Computing Surveys (CSUR)
A logic-based theory of deductive arguments
Artificial Intelligence
A Reasoning Model Based on the Production of Acceptable Arguments
Annals of Mathematics and Artificial Intelligence
On the computational complexity of assumption-based argumentation for default reasoning
Artificial Intelligence
Defeasible logic programming: an argumentative approach
Theory and Practice of Logic Programming
Dialectic proof procedures for assumption-based, admissible argumentation
Artificial Intelligence
Practical first-order argumentation
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
A common assumption for logic-based argumentation is that an argument is a pair where Φ is a minimal subset of the knowledgebase such that Φ is consistent and Φ entails the claim α. Different logics are based on different definitions for entailment and consistency, and these give us different options for argumentation. For a variety of logics, in particular for classical logic, there is a need to develop intelligent techniques for generating arguments. Since building a constellation of arguments and counterarguments involves repeatedly querying a knowledgebase, we propose a framework based on what we call “contours” for storing information about a knowledgebase that provides boundaries on what is provable in the knowledgebase. Using contours allows for more intelligent searching of a knowledgebase for arguments and counterarguments.