An Algorithm for Generating Arguments in Classical Predicate Logic.
In: Sossai, C and Chemello, G, (eds.)
SYMBOLIC AND QUANTITATIVE APPROACHES TO REASONING WITH UNCERTAINTY, PROCEEDINGS.
(pp. 119 - 130).
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 <Phi, alpha > where Phi is a, minimal subset of the knowledgebase such that Phi is consistent and Phi entails the claim alpha. 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.
|Title:||An Algorithm for Generating Arguments in Classical Predicate Logic|
|Event:||10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty|
|Dates:||2009-07-01 - 2009-07-03|
|UCL classification:||UCL > School of BEAMS > Faculty of Engineering Science > Computer Science|
Archive Staff Only