Easy problems are sometimes hard
Artificial Intelligence
The complexity of logic-based abduction
Journal of the ACM (JACM)
Generating hard satisfiability problems
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
A Proof Procedure Using Connection Graphs
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
A logic-based theory of deductive arguments
Artificial Intelligence
Logic for Problem Solving
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
Elements of Argumentation
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
Practical first-order argumentation
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Dialectic proof procedures for assumption-based, admissible argumentation
Artificial Intelligence
Focused search for arguments from propositional knowledge
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
An Algorithm for Generating Arguments in Classical Predicate Logic
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Encoding deductive argumentation in quantified Boolean formulae
Artificial Intelligence
The Knowledge Engineering Review
Plato: a compiler for interactive web forms
PADL'11 Proceedings of the 13th international conference on Practical aspects of declarative languages
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 logicbased argumentation is that an argument is a pair 〈φ, α〉 where φ is minimal subset of the knowledgebase such that φ is consistent and φ entails the claim α. 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. Here we propose ameliorating this problem by using connection graphs to give information on the ways that formulae of the knowledgebase can be used to minimally and consistently entail a claim. Using a connection graph allows for a substantially reduced search space to be used when seeking all the arguments for a claim from a knowledgebase. We provide a theoretical framework and algorithms for this proposal, together with some theoretical results and some preliminary experimental results to indicate the potential of the approach.