An Algorithm for Generating Arguments in Classical Predicate Logic

Authors:
Vasiliki Efstathiou;Anthony Hunter
Affiliations:
Department of Computer Science, University College London, London, UK WC1E 6BT;Department of Computer Science, University College London, London, UK WC1E 6BT
Venue:
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Year:
2009

Citing 11
Cited 0

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)
Logical models of argument

ACM Computing Surveys (CSUR)
A logic-based theory of deductive arguments

Artificial Intelligence
Logic for Problem Solving

Logic for Problem Solving
A Reasoning Model Based on the Production of Acceptable Arguments

Annals of Mathematics and Artificial Intelligence
Defeasible logic programming: an argumentative approach

Theory and Practice of Logic Programming
Elements of Argumentation

Elements of Argumentation
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
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 *** is a 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. An appealing option is classical first-order logic which can express much more complex knowledge than possible with defeasible or classical propositional logics. However the computational viability of using classical first-order logic is an issue. Here we address this issue by using the notion of a connection graph and resolution with unification. We provide a theoretical framework and algorithm for this, together with some theoretical results.