An algorithm for generating arguments in classical predicate logic

TitleAn algorithm for generating arguments in classical predicate logic
Publication TypeBook Chapters
Year of Publication2009
AuthorsEfstathiou, V, Hunter, A
Book TitleSymbolic and Quantitative Approaches to Reasoning with Uncertainty
AbstractThere are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing con icting 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.
URL agorithm for generating arguments in classical predicate logic.pdf