The complexity of logic-based abduction
Journal of the ACM (JACM)
Default reasoning using classical logic
Artificial Intelligence
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
Coherence in finite argument systems
Artificial Intelligence
Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Defeasible logic programming: an argumentative approach
Theory and Practice of Logic Programming
Dialectic proof procedures for assumption-based, admissible argumentation
Artificial Intelligence
Argumentation in artificial intelligence
Artificial Intelligence
Computing Arguments and Attacks in Assumption-Based Argumentation
IEEE Intelligent Systems
Elements of Argumentation
A solver for QBFs in negation normal form
Constraints
A review of current defeasible reasoning implementations
The Knowledge Engineering Review
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
Argue tuProlog: A Lightweight Argumentation Engine for Agent Applications
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
An algorithm to compute minimally grounded and admissible defence sets in argument systems
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
On the complexity of linking deductive and abstract argument systems
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Algorithms for effective argumentation in classical propositional logic: a connection graph approach
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Algorithms for generating arguments and counterarguments in propositional logic
International Journal of Approximate Reasoning
| Hi-index | 0.00 |
There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting arguments. A common assumption for logic-based argumentation is that an argument is a pair where @F is minimal subset of the knowledge-base such that @F is consistent and @F entails the claim @a. Different logics provide different definitions for consistency and entailment and hence give us different options for argumentation. Classical propositional logic is an appealing option for argumentation but the computational viability of generating an argument is an issue. To better explore this issue, we use quantified Boolean formulae to characterise an approach to argumentation based on classical logic.