The complexity of logic-based abduction
Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
A Proof Procedure Using Connection Graphs
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
A logic-based theory of deductive arguments
Artificial Intelligence
On the computational complexity of assumption-based argumentation for default reasoning
Artificial Intelligence
Dialectical Proof Theories for the Credulous Preferred Semantics of Argumentation Frameworks
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Comparing Arguments Using Preference Orderings for Argument-Based Reasoning
ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
An argumentation framework for merging conflicting knowledge bases
International Journal of Approximate Reasoning
Argumentation-Based Inference and Decision Making--A Medical Perspective
IEEE Intelligent Systems
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
Focused search for arguments from propositional knowledge
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
Encoding deductive argumentation in quantified Boolean formulae
Artificial Intelligence
Dialectic proof procedures for assumption-based, admissible argumentation
Artificial Intelligence
An argument-based approach to reasoning with clinical knowledge
International Journal of Approximate Reasoning
The Complexity of the Warranted Formula Problem in Propositional Argumentation
Journal of Logic and Computation
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
Generating possible intentions with constrained argumentation systems
International Journal of Approximate Reasoning
A probabilistic approach to modelling uncertain logical arguments
International Journal of Approximate Reasoning
A generalised framework for dispute derivations in assumption-based argumentation
Artificial Intelligence
| Hi-index | 0.00 |
A common assumption for logic-based argumentation is that an argument is a pair where @F is minimal subset of the knowledgebase 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 formalising arguments and counterarguments. The expressivity of classical propositional logic allows for complicated knowledge to be represented but its computational cost is an issue. In previous work we have proposed addressing this problem using connection graphs and resolution in order to generate arguments for claims that are literals. Here we propose a development of this work to generate arguments for claims that are disjunctive clauses of more than one disjunct, and also to generate counteraguments in the form of canonical undercuts (i.e. arguments that with a claim that is the negation of the conjunction of the support of the argument being undercut).