Structural Properties for Deductive Argument Systems
نویسندگان
چکیده
There have been a number of proposals for using deductive arguments for instantiating abstract argumentation. These take a set of formulae as a knowledgebase, and generate a graph where each node is a logical argument and each arc is a logical attack. This then raises the question of whether for a specific logical argument system S, and for any graph G, there is a knowledgebase such that S generates G. If it holds, then it can be described as a kind of “structural” property of the system. If it fails then, it means that there are situations that cannot be captured by the system. In this paper, we explore some features, and the significance, of such structural properties.
منابع مشابه
On the Complexity of Linking Deductive and Abstract Argument Systems
We investigate the computational complexity of a number of questions relating to deductive argument systems, in particular the complexity of linking deductive and more abstract argument systems. We start by presenting a simple model of deductive arguments based on propositional logic, and define logical equivalence and defeat over individual arguments. We then extend logical equivalence to sets...
متن کاملRule-based Calculi for Extensions of Logic Programming
The focus of this paper lies on the proof-theory for extensions of Logic Programming in which it is possible to draw negative conclusions both in a direct (i.e., based on a proof) and in an indirect (i.e., based on the lack of a proof) way. These extensions are provided with a rule-based deductive system in the sense of the work of Jager [8] for Normal Logic Programs. Rule-based deductive syst...
متن کاملIdentifying Audience Preferences in Legal and Social Domains
Reasoning in legal and social domains appears not to be well dealt with by deductive approaches. This is because such reasoning is open-endedly defeasible, and because the various argument schemes used in these domains are often hard to construe as deductive arguments. In consequence, argumentation frameworks have proved increasingly popular for modelling disputes in such domains. In order to c...
متن کاملTowards Computational Models of Natural Argument using Labelled Deductive Systems
During the last decade computational models of argument have emerged as a successful approach to the formalization of commonsense reasoning, encompassing many other alternative formalisms. Common elements can be identified in such frameworks along with a number of particular features which make it difficult to compare them with each other from a logical viewpoint. This paper presents a unifying...
متن کاملConstructing argument graphs with deductive arguments: a tutorial
argumentation, as proposed by Dung (1995), provides a good starting point for formalizing argumentation. Dung proposed that a set of arguments and counterarguments could be represented by a directed graph. Each node in the graph denotes an argument and each arc denotes one argument attacking another. So if there is an arc from node A to node B, then A attacks B, or equivalently A is a counterar...
متن کامل