In the current paper, we re-examine the concept of strong admissibility, as was originally introduced by Baroni and Giacomin. We examine the formal properties of strong admissibility, both in its e...

According to informal logic, the possibilities of deductive logic as a tool for analysing and evaluating ordinary arguments are very limited. While I agree with this claim in general, I question it in the case of the argument from cause to effect. In this paper I first show, on the basis of carefully chosen examples, that we usually react differently to falsification of the conclusion of the argument from cause to effect than we do to the falsification of the conclusion (...) of other defeasible arguments. I then identify general conditions and assumptions under which the causal argument from cause to effect can be reconstructed as deductive. Finally, I compare the causal argument with the expert argument, which is a typical example of a defeasible argument in the narrower sense. (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)

J. Anthony Blair is a prominent international figure in argumentation studies. He is among the originators of informal logic, an author of textbooks on the informal logic approach to argument analysis and evaluation and on critical thinking, and a founder and editor of the journal Informal Logic. Blair is widely recognized among the leaders in the field for contributing formative ideas to the argumentation literature of the last few decades. This selection of key works provides insights into the history of (...) the field of argumentation theory and various related disciplines. It illuminates the central debates and presents core ideas in four main areas: Critical Thinking, Informal Logic, Argument Theory and Logic, Dialectic and Rhetoric. (shrink)

One leading approach to justification comes from the reliabilist tradition, which maintains that a belief is justified provided that it is reliably formed. Another comes from the ‘Reasons First’ tradition, which claims that a belief is justified provided that it is based on reasons that support it. These two approaches are typically developed in isolation from each other; this essay motivates and defends a synthesis. On the view proposed here, justification is understood in terms of an agent’s reasons for belief, (...) which are in turn analyzed along reliabilist lines: an agent's reasons for belief are the states that serve as inputs to their reliable processes. I show that this synthesis allows each tradition to profit from the other's explanatory resources. In particular, it enables reliabilists to explain epistemic defeat without abandoning their naturalistic ambitions. I go on to compare my proposed synthesis with other hybrid versions of reliabilism that have been proposed in the literature. (shrink)

Formal models of argumentation have been investigated in several areas, from multi-agent systems and artificial intelligence (AI) to decision making, philosophy and law. In artificial intelligence, logic-based models have been the standard for the representation of argumentative reasoning. More recently, the standard logic-based models have been shown equivalent to standard connectionist models. This has created a new line of research where (i) neural networks can be used as a parallel computational model for argumentation and (ii) neural networks can be used (...) to combine argumentation, quantitative reasoning and statistical learning. At the same time, non-standard logic models of argumentation started to emerge. In this paper, we propose a connectionist cognitive model of argumentation that accounts for both standard and non-standard forms of argumentation. The model is shown to be an adequate framework for dealing with standard and non-standard argumentation, including joint-attacks, argument support, ordered attacks, disjunctive attacks, meta-level attacks, self-defeating attacks, argument accrual and uncertainty. We show that the neural cognitive approach offers an adequate way of modelling all of these different aspects of argumentation. We have applied the framework to the modelling of a public prosecution charging decision as part of a real legal decision making case study containing many of the above aspects of argumentation. The results show that the model can be a useful tool in the analysis of legal decision making, including the analysis of what-if questions and the analysis of alternative conclusions. The approach opens up two new perspectives in the short-term: the use of neural networks for computing prevailing arguments efficiently through the propagation in parallel of neuronal activations, and the use of the same networks to evolve the structure of the argumentation network through learning (e.g. to learn the strength of arguments from data). (shrink)

Several authors have recently begun to apply virtue theory to argumentation. Critics of this programme have suggested that no such theory can avoid committing an ad hominem fallacy. This criticism is shown to trade unsuccessfully on an ambiguity in the definition of ad hominem. The ambiguity is resolved and a virtue-theoretic account of ad hominem reasoning is defended.

I provide an interpretation of Wittgenstein's much criticized remarks on Gödel's First Incompleteness Theorem in the light of paraconsistent arithmetics: in taking Gödel's proof as a paradoxical derivation, Wittgenstein was right, given his deliberate rejection of the standard distinction between theory and metatheory. The reasoning behind the proof of the truth of the Gödel sentence is then performed within the formal system itself, which turns out to be inconsistent. I show that the models of paraconsistent arithmetics (obtained via the Meyer-Mortensen (...) collapsing filter on the standard model) match with many intuitions underlying Wittgensteins philosophy of mathematics, such as its strict finitism and the insistence on the decidability of any meaningful mathematical question. (shrink)

This article investigates to what extent protocols for dynamicdisputes, i.e., disputes in which the information base can vary at differentstages, can be justified in terms of logics for defeasible argumentation. Firsta general framework is formulated for dialectical proof theories for suchlogics. Then this framework is adapted to serve as a framework for protocols fordynamic disputes, after which soundness and fairness properties are formulated for such protocols relative to dialectical proof theories. It then turns out that certaintypes of protocols that are (...) perfectly fine with a static information base, arenot sound or fair in a dynamic setting. Finally, a natural dynamic protocolis defined for which soundness and fairness can be established. (shrink)

Inspired by legal reasoning, this paper presents a formal framework for assessing conflicting arguments. Its use is illustrated with applications to realistic legal examples, and the potential for implementation is discussed. The framework has the form of a logical system for defeasible argumentation. Its language, which is of a logic-programming-like nature, has both weak and explicit negation, and conflicts between arguments are decided with the help of priorities on the rules. An important feature of the system is that these priorities (...) are not fixed, but are themselves defeasibly derived as conclusions within the system. Thus debates on the choice between conflicting arguments can also be modelled.The proof theory of the system is stated in dialectical style, where a proof takes the form of a dialogue between a proponent and an opponent of an argument. An argument is shown to be justified if the proponent can make the opponent run out of moves in whatever way the opponent attacks. Despite this dialectical form, the system reflects a declarative, or relational approach to modelling legal argument. A basic assumption of this paper is that this approach complements two other lines of research in AI and Law, investigations of precedent-based reasoning and the development of procedural, or dialectical models of legal argument. (shrink)

Although resolution-based inference is perhaps the industry standard in automated theorem proving, there have always been systems that employed a different format. For example, the Logic Theorist of 1957 produced proofs by using an axiomatic system, and the proofs it generated would be considered legitimate axiomatic proofs; Wang’s systems of the late 1950’s employed a Gentzen-sequent proof strategy; Beth’s systems written about the same time employed his semantic tableaux method; and Prawitz’s systems of again about the same time are often (...) said to employ a natural deduction format. [See Newell, et al (1957), Beth (1958), Wang (1960), and Prawitz et al (1960)]. Like sequent proof systems and tableaux proof systems, natural deduction systems retain.. (shrink)

If good argument is virtuous, then fallacies are vicious. Yet fallacies cannot just be identified with vices, since vices are dispositional properties of agents whereas fallacies are types of argument. Rather, if the normativity of good argumentation is explicable in terms of virtues, we should expect the wrongness of fallacies to be explicable in terms of vices. This approach is defended through case studies of several fallacies, with particular emphasis on the ad hominem.

Postulational approaches attempt to understand the dynamics of belief revision by appealing to no more than the set of beliefs held by an agent and the logical relations between them. It is argued there that such an approach cannot work. A proper account of belief revision must also appeal to the arguments supporting beliefs, and recognize that those arguments can be defeasible. If we begin with a mature epistemological theory that accommodates this, it can be seen that the belief revision (...) operators on which the postulational theories are based are ill-defined. It is further argued that there is no way to repair the definitions so as to retain the spirit of those theory. Belief revision is better studied from within an independently motivated epistemological theory. (shrink)

An argument is self-defeating when it contains defeaters for some of its own defeasible lines. It is shown that the obvious rules for defeat among arguments do not handle self-defeating arguments correctly. It turns out that they constitute a pervasive phenomenon that threatens to cripple defeasible reasoning, leading to almost all defeasible reasoning being defeated by unexpected interactions with self-defeating arguments. This leads to some important changes in the general theory of defeasible reasoning.

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)

Though it''s difficult to agree on the exact date of their union, logic and artificial intelligence (AI) were married by the late 1950s, and, at least during their honeymoon, were happily united. What connubial permutation do logic and AI find themselves in now? Are they still (happily) married? Are they divorced? Or are they only separated, both still keeping alive the promise of a future in which the old magic is rekindled? This paper is an attempt to answer these questions (...) via a review of six books. Encapsulated, our answer is that (i) logic and AI, despite tabloidish reports to the contrary, still enjoy matrimonial bliss, and (ii) only their future robotic offspring (as opposed to the children of connectionist AI) will mark real progress in the attempt to understand cognition. (shrink)

We introduce a general approach for representing and reasoning with argumentation-based systems. In our framework arguments are represented by Gentzen-style sequents, attacks between arguments are represented by sequent elimination rules, and deductions are made according to Dung-style skeptical or credulous semantics. This framework accommodates different languages and logics in which arguments may be represented, allows for a flexible and simple way of expressing and identifying arguments, supports a variety of attack relations, and is faithful to standard methods of drawing conclusions (...) by argumentation frameworks. Altogether, we show that argumentation theory may benefit from incorporating proof theoretical techniques and that different non-classical formalisms may be used for backing up intended argumentation semantics. (shrink)

John Pollock (1940?2009) was an influential American philosopher who made important contributions to various fields, including epistemology and cognitive science. In the last 25 years of his life, he also contributed to the computational study of defeasible reasoning and practical cognition in artificial intelligence. He developed one of the first formal systems for argumentation-based inference and he put many issues on the research agenda that are still relevant for the argumentation community today. This paper presents an appreciation of Pollock's work (...) on defeasible reasoning and its relevance for the computational study of argument. In our opinion, Pollock deserves to be remembered as one of the founding fathers of the field of computational argument, while, moreover, his work contains important lessons for current research in this field, reminding us of the richness of its object of study. (shrink)

The first issue of _Artificial Intelligence and Law_ journal was published in 1992. This paper provides commentaries on landmark papers from the first decade of that journal. The topics discussed include reasoning with cases, argumentation, normative reasoning, dialogue, representing legal knowledge and neural networks.

This paper explores the relationship between informal reasoning, creativity in mathematics, and problem solving. It underscores the importance of environments that promote interaction, hypothesis generation, examination, refutation, derivation of new solutions, drawing conclusions, and reasoning with others, as key factors in enhancing mathematical creativity. Drawing on argumentation logic, the paper proposes a novel approach to uncover specific characteristics in the development of formalized proving using “proof-events.” Argumentation logic can offer reasoning mechanisms that facilitate these environments. This paper proposes how argumentation (...) can be implemented to discover certain characteristics in the development of formalized proving with “proof-events”. The concept of a proof-event was introduced by Goguen who described mathematical proof as a multi-agent social event involving not only “classical” formal proofs, but also other informal proving actions such as deficient or alleged proofs. Argumentation is an integral component of the discovery process for a mathematical proof since a proof necessitates a dialogue between provers and interpreters to clarify and resolve gaps or assumptions. By formalizing proof-events through argumentation, this paper demonstrates how informal reasoning and conflicts arising during the proving process can be effectively simulated. The paper presents an extended version of the proof-events calculus, rooted in argumentation theories, and highlights the intricate relationships among proof, human reasoning, cognitive processes, creativity, and mathematical arguments. (shrink)

Since e-Commerce has become a discipline, e-Contracts are acknowledged as the tools that will assure the safety and robustness of the transactions. A typical e-Contract is a binding agreement between parties that creates relations and obligations. It consists of clauses that address specific tasks of the overall procedure which can be represented as workflows. Similarly to e-Contracts, Intelligent Agents manage a private policy, a set of rules representing requirements, obligations and restrictions, additionally to personal data that meet their user’s interests. (...) In this context, this study aims at proposing a policy-based e-Contract workflow management methodology that can be used by semantic web agents, since agents benefit from Semantic Web technologies for data and policy exchanges, such as RDF and RuleML that maximize interoperability among parties. Furthermore, this study presents the integration of the above methodology into a multi-agent knowledge-based framework in order to deal with issues related to rules exchange where no common syntax is used, since this framework provides reasoning services that assist agents in interpreting the exchanged policies. Finally, a B2C e-Commerce scenario is presented that demonstrates the added value of the approach. (shrink)

Khemlani et al. (2018) mischaracterize logic in the course of seeking to show that mental model theory (MMT) can accommodate a form of inference (, let us label it) they find in a high percentage of their subjects. We reveal their mischaracterization and, in so doing, lay a landscape for future modeling by cognitive scientists who may wonder whether human reasoning is consistent with, or perhaps even capturable by, reasoning in a logic or family thereof. Along the way, we note (...) that the properties touted by Khemlani et al. as innovative aspects of MMT‐based modeling (e.g., nonmonotonicity) have for decades been, in logic, acknowledged and rigorously specified by families of (implemented) logics. Khemlani et al. (2018) further declare that is “invalid in any modal logic.” We demonstrate this to be false by our introduction (Appendix A) of a new propositional modal logic (within a family of such logics) in which is provably valid, and by the implementation of this logic. A second appendix, B, partially answers the two‐part question, “What is a formal logic, and what is it for one to capture empirical phenomena?”. (shrink)

This paper aims at comparing and relating belief revision and argumentation as approaches to model reasoning processes. Referring to some prominent literature references in both fields, we will discuss their (implicit or explicit) assumptions on the modeled processes and hence commonalities and differences in the forms of reasoning they are suitable to deal with. The intended contribution is on one hand assessing the (not fully explored yet) relationships between two lively research fields in the broad area of defeasible reasoning and (...) on the other hand pointing out open issues and potential directions for future research. (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)

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)

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)

To summarize, in order for rational agents to be able to engage in the sophisticated kinds of reasoning exemplified by human beings, they must be able to introspect much of their cognition. The problem of other minds and the problem of knowing the mental states of others will arise automatically for any rational agent that is able to introspect its own cognition. The most that a rational agent can reasonably believe about other rational agents is that they have rational architectures (...) similar to its own, and that they have thoughts related to their rational architectures in certain ways. This leads to Rational Functionalism as an account of what it is to be a cognizer having mental states. That in turn entails that a computer can be a person in precisely the same sense as my next door neighbor if it can appropriately mimic my rational architecture. There is nothing I could know about my neighbor that I could not believe with equal justification about the computer. Rational Functionalism also makes it reasonable to define the narrow content of a thought to be its overall place in the agent's rational architecture, that is, its conceptual role. This is, however, avery narrow notion of content. For practical purposes, we are not interested in knowing the narrow contents of other people's thoughts. We are only interested in rather general properties of those narrow contents. This is what is expressed by the use ofthat-clauses in public language. (shrink)

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)