UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

An Algorithm for Generating Arguments in Classical Predicate Logic

Efstathiou, V; Hunter, A; (2009) 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). SPRINGER-VERLAG BERLIN

Full text not available from this repository.


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.

Type: Proceedings paper
Title: An Algorithm for Generating Arguments in Classical Predicate Logic
Event: 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Location: Verona, ITALY
Dates: 2009-07-01 - 2009-07-03
ISBN-13: 978-3-642-02905-9
URI: http://discovery.ucl.ac.uk/id/eprint/164075
Downloads since deposit
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item