Academia.edu no longer supports Internet Explorer.
To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser.
Human reasoning applies argumentation patterns to draw conclusions about a particular subject. These patterns represent the structure of the arguments in the form of argumentation schemes which are useful in AI to emulate human reasoning. A type of argument schema is that what allow to analyze the similarities and differences between two arguments, to find a solution to a new problem from an already known one. Researchers in the heavily studied field of analogies in discourse have recognized that there is not a full and complete definition to indicate when two arguments are considered analogous. Our proposal presents an initial attempt to formalize argumentation schemes based on analogies, considering a relationship of analogy between arguments. This will contribute to the area increasing such schemes usefulness in Artificial Intelligence (AI), since it can be implemented later in Defeasible Logic Programming (DeLP).
Systematic Approaches to Argument from Analogy, ed. H. J. Ribeiro, Heidelberg, Springer, 2014, 23-40.
This paper shows why a double scheme approach to argument from analogy is justified. It shows how the one scheme applies to the famous violinist case of argument from analogy in philosophy. It shows how factors are weighed in systems of case-based reasoning. It analyzes a famous case of argument from analogy in legal rhetoric using a notion of similarity using script-based technology from artificial intelligence.
ISSA Conference Proceedings , 2023
The thesis of this paper is that what characterises argumentation by analogy is that it is based on a comparison of argumentative relationships. I distinguish two types: intraargumentative relationships and interargumentative relationships. By the former I mean the relationship between what is presented as a reason and the claim that reason allegedly support. This is usually marked by expressions such as 'so,' 'therefore,' 'because,' 'consequently,' etc. By interargumentative relationships I mean the relationship between two or more reasons. This is usually marked both by coordinative locutions such as 'in addition,' 'on the other hand,' 'moreover,' etc., and by adversatives expressions such as 'but,' 'although,' 'having said that,' and so on. On the basis of this, two varieties of argumentation by analogy are distinguished: argumentation by parity of reasons and argumentation by parity of weighings.
Informal Logic, 2022
John Woods and Brent Hudak’s theory on arguments by analogy (1989), although correct in its meta-argumentative approach, gives rise to problems when we consider the possibility of weighing reasons. I contend that this is an outcome of construing the relationship between the premises and the conclusion of arguments compared in argumenta-tion by analogy as inferences. An interpretation in terms of reasons is proposed here. The reasons-based approach solves these problems and allows the theory to be extended to account for a particular variant of argumentation by analogy in which the subjects of comparison are not arguments, but weighings of reasons
2014
Argumentation has contributed to the formalization of a reasoning model, similar to the human reasoning. In general, argumentation can be associated with the interaction of reasons in favour and against certain conclusions, so as to determine what conclusions are acceptable. A way of arguing in which the way in which the arguments are constructed, is Defeasible Logic Programming (DeLP); this is a formalism that combines logic programming and defeasible argumentation. This work focuses on the strengthening of the reasoning process, identifying partial connections or determinations between knowledge pieces. Through these relations, it is possible to increase the justifications and foundations that support a particular recommendation, by an analogy process.
The reasoning process of analogy is characterized by a strict interdependence between a process of abstraction of a common feature and the transfer of an attribute of the Analogue to the Primary Subject. The first reasoning step is regarded as an abstraction of a generic characteristic that is relevant for the attribution of the predicate. The abstracted feature can be considered from a logic-semantic perspective as a functional genus, in the sense that it is contextually essential for the attribution of the predicate, i.e. that is pragmatically fundamental (i.e. relevant) for the predica-tion, or rather the achievement of the communicative intention. While the transfer of the predicate from the Analogue to the analogical genus and from the genus to the Primary Subject is guaranteed by the maxims (or rules of inference) governing the genus-species relation, the connection between the genus and the predicate can be complex, characterized by various types of reasoning patterns. The relevance relation can hide implicit arguments, such as an implicit argument from classification , an evaluation based on values, consequences or rules, a causal relation, or an argument from practical reasoning.
In this paper a hybrid model of argument from analogy is presented that combines argumentation schemes and story schemes. Story schemes are abstract representations of stories (narratives, explanations) based on common knowledge about how sequences of actions and events we are familiar with can normally be expected to unfold.
2019
In this paper, we propose a framework for the dialogical evaluation of analogical arguments whose method of ensuring relevant utterances is built-in. This is done through what we call warrant-based reasoning, a framework for assessing an informal argument’s quality by evaluating the strongest warrants that can be found in its support. We have created a computer program which restricts the “moves” participants can make to those which focus on the common warrant shared by the source and target domains of the analogy.
Argument & Computation, 2021
Argumentation schemes [35,80,91] are a relatively recent notion that continues an extremely ancient debate on one of the foundations of human reasoning, human comprehension, and obviously human argumentation, i.e., the topics. To understand the revolutionary nature of Walton's work on this subject matter, it is necessary to place it in the debate that it continues and contributes to, namely a view of logic that is much broader than the formalistic perspective that has been adopted from the 20th century until nowadays. With his book Argumentation schemes for presumptive reasoning, Walton attempted to start a dialogue between three different fields or views on human reasoning-one (argumentation theory) very recent, one (dialectics) very ancient and with a very long tradition, and one (formal logic) relatively recent, but dominating in philosophy. Argumentation schemes were proposed as dialectical instruments, in the sense that they represented arguments not only as formal relations, but also as pragmatic inferences, as they at the same time depend on what the interlocutors share and accept in a given dialogical circumstance, and affect their dialogical relation. In this introduction, the notion of argumentation scheme will be analyzed in detail, showing its different dimensions and its defining features which make them an extremely useful instrument in Artificial Intelligence. This theoretical background will be followed by a literature review on the uses of the schemes in computing, aimed at identifying the most important areas and trends, the most promising proposals, and the directions of future research.
2007
Whereas approaches for deductive and inductive reasoning are well-examined for decades, analogical reasoning seems to be a hard problem for machine intelligence. Although several models for computing analogies have been proposed, there is no uncontroversial theory of the semantics of analogies. In this paper, we will investigate semantic issues of analogical relations, in particular, we will specify a model theory of analogical transfers. The presented approach is based on Heuristic-Driven Theory Projection (HDTP) a framework that computes an analogical relation between logical theories describing a source and a target domain. HDTP establishes the analogy by an abstraction process in which formulas from both domains are generalized creating a theory that syntactically subsumes the original theories. We will show that this syntactic process can be given a sensible interpretation on the semantic level. In particular, given models of the source and the target domains, we will examine t...
2008
Human-level reasoning is manifold and comprises a wide variety of different reasoning mechanisms. So far, artificial intelligence has focused mainly on using the classical approaches deduction, induction, and abduction to enable machines with reasoning capabilities. However, the approaches are limited and do not reflect the mental, cognitive process of human reasoning very well. We contend that analogical reasoning is the driving force behind human thinking and therefore propose analogy as an integrating framework for the variety of human-level reasoning mechanisms.
Cognitive Systems Research, 2009
This paper introduces the various forms of analogy in NARS, a general-purpose reasoning system. NARS is an AI system designed to be adaptive and to work with insufficient knowledge and resources. In the system, multiple types of inference, including analogy, deduction, induction, abduction, comparison, and revision, are unified both in syntax and in semantics. The system can also carry out
Artificial Intelligence and Law, 18 (3), 2010, 217-246. , 2010
In this paper, it is shown (1) that there are two schemes for argument from analogy that seem to be competitors but are not, (2) how one of them is based on a distinctive type of similarity premise, (3) how to analyze the notion of similarity using story schemes illustrated by some cases, (4) how arguments from precedent are based on arguments from analogy, and in many instances arguments from classification, and (5) that when similarity is defined by means of story schemes, we can get a clearer idea of how it integrates with the use of argument from classification and argument from precedent in case-based reasoning by using a dialogue structure.
We analyze the logical form of the domain knowledge that grounds analogical inferences and generalizations from a single instance. The form of the assumptions which justify analogies is given schematically as the "determination rule", so called because it expresses the relation of one set of variables determining the values of another set. The determination relation is a logical generalization of the different types of dependency relations defined in database theory. Specifically, we define determination as a relation between schemata of first order logic that have two kinds of free variables: (1) object variables and what we call "polar" variables, which hold the place of truth values. Determination rules facilitate sound rule inference and valid conclusions projected by analogy from single instances, without implying what the conclusion should be prior to an inspection of the instance. They also provide a way to specify what information is sufficiently relevant to decide a question, prior to knowledge of the answer to the question. 1
2000
A formal model of analogy is introduced in the logic programming setting, and an analogical reasoning program (called DIANA, i.e. Declarative Inference by ANAlogy) is developed in accordance with precise procedural and declarative semantics. Given the source and target domains of analogy as two logic programs Ps and Pt, together with a specification S of the analogical correspondence between predicate symbols, atoms involving these symbols are analogically derived from P = Ps U Pt given S, which are not derivable from Ps or Pt or Ps U Pt alone. In this paper, the requirements of the analogical process are first stated. The declarative semantics of analogy is then given, by defining the least analogical model of P as an extension of the classical semantics of Horn clauses. A procedural semantics is also described, in terms of an extension of SLD resolution. Both semantics rely on implicit analogical axioms defining the kind of analogical reasoning envisaged. The implementation of DIANA has been done in Reflective Prolog, a metalogic programming language previously developed by the first two authors. It is shown that analogical axioms can be viewed as an instance of reflection axioms used in Reflective Prolog. By exploiting this feature, the implementation of DIANA is argued to be sound w.r.t, the defined semantics. Examples of analogical reasoning in DIANA are also described. By comparison with the AI literature on analogy, it is claimed that this is the first approach which gives a declarative semantics to analogical reasoning, thanks to the possibility of carrying over in this field the basic logic programming concepts.
Informal Logic, 2012
Following a Toulmian account of argument analysis and evaluation, I offer a general unitary schema for, so called, deductive and inductive types of analogical arguments. This schema is able to explain why certain analogical arguments can be said to be deductive, and yet, also defeasible.
2016
Several investigations have been developed around analogies based reasoning in different domains, however the analogy between arguments has not been deeply explored. A semiformal way to express these patterns of reasoning were proposed by Walton, through argument schemes from analogy. From this, it is possible to propose computable approximations for comparing arguments. In this paper we introduce a formalism based on the comparison of arguments through descriptors or labels which describes an aspect that the argument refers to. This formalism allows us classifying similar arguments considering the natural descriptors of them, in a specific context.
Informal Logic, 2001
Analogies come in several forms that serve distinct functions. Inductive analogy is a common type of analogical argument, but critical thinking texts sometimes treat all analogies as inductive. Such an analysis ignores figurative analogies, which may elucidate but do not argue; and also neglects a priori arguments by analogy, a type of analogical argument prominent in law and ethics. A priori arguments by analogy are distinctive, but-contrary to the claims of Govier and Sunstein-they are best understood as deductive, rath«r than a special form of non deductive reasoning. Resume: Les analogies ont differentes formes et fonctions. L'analogie inductive est une forme courante d"un argument par analog ie, mais des manuels de pen see critique traitent parfois toutes les analogies comme si elles etaient inductives. Une teUe analyse ignore les analogies figurees, dont la fonction est parfois d'elucider et non d'argumenter. Cette analyse ne tient pas compte aussi des arguments a priori par anaJogie, qui s'empJoient souvent en droit et en ethique. Les arguments a priori par analogie constituent une autre forme distincte d'analogie, et contrairement it I'avis de Govier et de Sunstein. its sont deductifs plutOt qu'une espece speciale de raisonnement non-deductif.
Journal of Intelligent Information Systems, 2017
Analogy is the cognitive process of matching the characterizing features of two different items. This may enable reuse of knowledge across domains , which can help to solve problems. Indeed, abstracting the 'role' of the features away from their specific embodiment in the single items is fundamental to recognize the possibility of an analogical mapping between them. The analogical reasoning process consists of five steps: retrieval, mapping, evaluation , abstraction and re-representation. This paper proposes two forms of an operator that includes all these elements, providing more power and flexibility than existing systems. In particular, the Roles Mapper leverages the presence of identical descriptors in the two domains, while the Roles Argumentation-based Mapper removes also this limitation. For generality and compliance with other reasoning operators in a multi-strategy inference setting, they exploit a simple formalism based on First-Order Logic and do not require any background knowledge or meta-knowledge. Applied to the most critical classical examples in the literature, they proved to be able to find insightful analogies.
Argumentation Library, 2015
The paper contributes to the debate about arguments by analogy, especially the distinction between 'deductive' and 'inductive' analogies and the question how such arguments can be 'deductive', yet nonetheless defeasible. It claims that 'deductive' and 'inductive' are structural, not normative categories, and should not be used to designate argument validity. Based on Aristotle's analysis of enthymemes, examples, and metaphors, it argues that arguments from analogy are complex arguments that involve inductive, abductive, and deductive components.
Analogy plays an important role in science as well as in non-scientific domains such as taxonomy or learning. We make explicit the difference and complementarity between the concept of analogical statement, which merely states that two objects have a relevant similarity, and the concept of analogical inference, which relies on the former in order to draw a conclusion from some premises. For the first, we show that it is not possible to give an absolute definition of what it means for two objects to be analogous; a relative definition of analogy is introduced, only relevant from some point of view. For the second, we argue that it is necessary to introduce a background over-hypothesis relating two sets of properties; the belief strength of the conclusion is then directly related to the belief strength of the over-hypothesis. Moreover, we assert the syntactical identity between analogical inference and one case induction despite important pragmatic differences.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.