Is a virtue approach in argumentation possible without committing the ad hominem fallacy? My answer is affirmative, provided that the object study of our theory is well delimited. My proposal is that a theory of argumentative virtue should not focus on argument appraisal, as has been assumed, but on those traits that make an individual achieve excellence in argumentative practices. An agent-based approach in argumentation should be developed, not in order to find better grounds for argument appraisal, but to gain (...) insight into argumentative habits and excellence. This way we can benefit from what a virtue argumentation theory really has to offer. (shrink)

We present a computational model of dialectical argumentation that could serve as a basis for legal reasoning. The legal domain is an instance of a domain in which knowledge is incomplete, uncertain, and inconsistent. Argumentation is well suited for reasoning in such weak theory domains. We model argument both as information structure, i.e., argument units connecting claims with supporting data, and as dialectical process, i.e., an alternating series of moves by opposing sides. Our model includes burden of proof as a (...) key element, indicating what level of support must be achieved by one side to win the argument. Burden of proof acts as move filter, turntaking mechanism, and termination criterion, eventually determining the winner of an argument. Our model has been implemented in a computer program. We demonstrate the model by considering program output for two examples previously discussed in the artificial intelligence and legal reasoning literature. (shrink)

Are there any logical norms for argument evaluation besides soundness and inductive strength? The paper will look at several concepts or models introduced over the years, including those of Wisdom, Toulmin, Wellman, Rescher, defeasible reasoning proponents and Walton to consider whether there is common ground among them that supplies an alternative to deductive validity and inductive strength.

Pollock is developing, and testing computationally a theory of rationality. I endorse his claim that the structure of argument is not always linear, his replacement of the deductive-inductive distinction with a deductive-defeasible distinction, and hi s distinction between rebutting defeaters, and undercutting defeaters. I question the absence of pragmatic constraints in his acceptance rule, an absence which fits ill with his criterion of interruptibility, that it is reasonable to act on the conclusions drawn at any point. I also wonder about (...) building a model of a rational agent in which there is no place for interpersonal argumentative discussion. (shrink)

Recent literature concerning laws of nature highlight the close relationship between general metaphysics and philosophy of science. In particular, a person's theoretical commitments in either have direct implications for her stance on laws. In this dissertation, I argue that an ontic structural realist should be a realist about laws, but only within a non-Whiteheadean process framework. Without the adoption of a process framework, any account of laws the ontic structural realist offers will require metaphysical commitments that are at odds with (...) ontic structural realism. In arguing towards this aim, I adopt an attenuated methodological naturalistic stance to show that traditional substance metaphysics, of the sort neo-Aristotelians endorse, is problematic and that we have naturalistic reasons for further developing process metaphysics. I then apply this framework to develop a processual account of mereological structures and show how we can understand structures as being stable processes. In the final section, I argue that these are the kind of structures with which the ontic structural realist concerns herself. By adopting a realist account of laws the ontic structural realist can explain how these structures enter into modal and causal relations. (shrink)

In 2001, W. Carnielli and Marcos considered a 3-valued logic in order to prove that the schema ϕ ∨ (ϕ → ψ) is not a theorem of da Costa’s logic Cω. In 2006, this logic was studied (and baptized) as G'3 by Osorio et al. as a tool to define semantics of logic programming. It is known that the truth-tables of G'3 have the same expressive power than the one of Łukasiewicz 3-valued logic as well as the one of Gödel (...) 3-valued logic G3. From this, the three logics coincide up-to language, taking into acccount that 1 is the only designated truth-value in these logics. -/- From the algebraic point of view, Canals-Frau and Figallo have studied the 3-valued modal implicative semilattices, where the modal operator is the well-known Moisil-Monteiro-Baaz Δ operator, and the supremum is definable from this. We prove that the subvariety obtained from this by adding a bottom element 0 is term-equivalent to the variety generated by the 3-valued algebra of G'3. The algebras of that variety are called G'3-algebras. From this result, we obtain the equations which axiomatize the variety of G'3-algebras. Moreover, we prove that this variety is semisimple, and the 3-element and the 2-element chains are the unique simple algebras of the variety. Finally an extension of G'3 to first-order languages is presented, with an algebraic semantics based on complete G'3-algebras. The corresponding soundness and completeness theorems are obtained. (shrink)

Este artículo presenta un análisis comparativo de los modelos de argumentación basados en las nociones de probabilidad subjetiva y de razonamiento plausible. Se hacen explícitos los “parecidos de familia” entre probabilidad y plausibilidad, y se examinan las diferencias en las prescripciones invocadas para la evaluación de tres tipos de falacias informales: apelación a la autoridad, a la popularidad y petición de principio. Se concluye que el razonamiento plausible, como Rescher y Walton lo describen, no proporciona una alternativa sólida a la (...) probabilidad como modelo normativo o descriptivo de la evaluación de argumentos. (shrink)