2410.12048v1

# Boosting Logical Fallacy Reasoning in LLMs via Logical Structure Tree ## Abstract Logical fallacy uses invalid or faulty reasoning in the construction of a statement. Despite the prevalence and harmfulness of logical fallacies, detecting and classifying logical fallacies still remains a challenging task. We observe that logical fallacies often use connective words to indicate an intended logical relation between two arguments, while the argument semantics does not actually support the logical relation. Inspired by this observation, we propose to build a logical structure tree to explicitly represent and track the hierarchical logic flow among relation connectives and their arguments in a statement. Specifically, this logical structure tree is constructed in an unsupervised manner guided by the constituency tree and a taxonomy of connectives for ten common logical relations, with relation connectives as non-terminal nodes and textual arguments as terminal nodes, and the latter are mostly elementary discourse units. We further develop two strategies to incorporate the logical structure tree into LLMs for fallacy reasoning. Firstly, we transform the tree into natural language descriptions and feed the textualized tree into LLMs as a part of the hard text prompt. Secondly, we derive a relation-aware tree embedding and insert the tree embedding into LLMs as a soft prompt. Experiments on benchmark datasets demonstrate that our approach based on logical structure tree significantly improves precision and recall for both fallacy detection and fallacy classification The code and data link is: https://github.com/yuanyuanlei-nlp/logical_fallacy_emnlp_2024. Boosting Logical Fallacy Reasoning in LLMs via Logical Structure Tree Yuanyuan Lei and Ruihong Huang Department of Computer Science and Engineering Texas A&M University, College Station, TX {yuanyuan, huangrh}@tamu.edu ## 1 Introduction <details> <summary>x1.png Details</summary>  ### Visual Description ## Logical Fallacy Diagrams: False Cause & Hasty Generalization ### Overview The image is a technical diagram illustrating two common logical fallacies: "False Cause" and "Hasty Generalization." It is divided into two horizontal sections by a dashed blue line. Each section contains a textual example of the fallacy on the left and a corresponding tree diagram on the right that breaks down the logical structure of the argument. The diagrams use green arrows to show relationships between propositions. ### Components/Axes The image is not a chart with axes but a conceptual diagram. Its components are: 1. **Section Dividers:** A horizontal dashed blue line separates the two fallacy examples. 2. **Text Blocks:** Each section begins with a labeled example of the fallacy in square brackets, followed by the argument text. 3. **Tree Diagrams:** Each argument is parsed into a hierarchical tree structure. * **Nodes:** Contain propositions or logical relationship labels. * **Edges:** Green arrows indicating the direction of logical dependency or relationship. * **Relationship Labels:** Placed above the arrows (e.g., "therefore (causal)", "as long as (condition)"). ### Detailed Analysis #### **Top Section: False Cause Fallacy** * **Textual Example (Left Side):** * Label: `[False Cause]` * Argument: "The region continues to report flu incidents **after** many people took the vaccination, **therefore**, the vaccinations **cause** increasing flu cases." * Key logical connectors are bolded in the original text: "after", "therefore", "cause". * **Tree Diagram (Right Side):** * **Root Node:** `therefore (causal)` * **First-Level Branches:** * Left Branch: `after (temporal)` * Right Branch: `cause (causal)` * **Second-Level Branches (from `after (temporal)`):** * Left Leaf: `The region continues to report flu incidents` * Right Leaf: `many people took the vaccination` * **Second-Level Branches (from `cause (causal)`):** * Left Leaf: `the vaccinations` * Right Leaf: `increasing flu cases` * **Spatial Grounding:** The tree is positioned to the right of its corresponding text. The root node is at the top center of the tree structure. The `after (temporal)` subtree is on the left, and the `cause (causal)` subtree is on the right. #### **Bottom Section: Hasty Generalization Fallacy** * **Textual Example (Left Side):** * Label: `[Hasty Generalization]` * Argument: "People will never get ill **as long as** they take this pill every day, **likewise**, my sister takes it regularly **and** is always healthy." * Key logical connectors are bolded: "as long as", "likewise", "and". * **Tree Diagram (Right Side):** * **Root Node:** `likewise (analogy)` * **First-Level Branches:** * Left Branch: `as long as (condition)` * Right Branch: `and (conjunction)` * **Second-Level Branches (from `as long as (condition)`):** * Left Leaf: `People will never get ill` * Right Leaf: `they take this pill every day` * **Second-Level Branches (from `and (conjunction)`):** * Left Leaf: `my sister takes it regularly` * Right Leaf: `is always healthy` * **Spatial Grounding:** The tree is positioned to the right of its text. The root node is at the top center. The `as long as (condition)` subtree is on the left, and the `and (conjunction)` subtree is on the right. ### Key Observations 1. **Structural Parallelism:** Both diagrams share an identical visual structure: a root node with two primary branches, each splitting into two leaf nodes. This emphasizes the comparative analysis of logical forms. 2. **Relationship Labeling:** The diagrams explicitly label the type of logical relationship (causal, temporal, conditional, conjunctive, analogical) at each branching point, which is the core of the analytical breakdown. 3. **Argument Deconstruction:** The trees successfully isolate the component claims of each argument. For "False Cause," it separates the observed temporal sequence (`after`) from the asserted causal conclusion (`therefore`). For "Hasty Generalization," it separates the general conditional rule (`as long as`) from the specific anecdotal evidence (`and`). ### Interpretation This diagram serves as an educational tool for dissecting flawed reasoning. It visually demonstrates how fallacious arguments are constructed. * **For False Cause (Post Hoc Ergo Propter Hoc):** The tree reveals the argument's core error. It correctly identifies two events occurring in sequence (`after`), but then incorrectly grafts a direct causal link (`therefore...cause`) between them. The diagram shows that the conclusion ("the vaccinations cause increasing flu cases") is not logically derived from the premises but is an added, unsupported inference. The fallacy lies in the `therefore (causal)` root node, which imposes a causal relationship where only a temporal one is established. * **For Hasty Generalization:** The tree exposes the flawed analogical leap. The argument presents a general conditional statement ("People will never get ill as long as...") and then uses a single specific case ("my sister...") as supporting evidence via the `likewise (analogy)` root. The diagram highlights that the conclusion about "people" in general is being supported by a sample size of one (the sister), which is insufficient. The structure shows the argument moving from a broad rule to a specific instance and then implicitly back to validating the rule, which is the essence of hasty generalization. **Overall Purpose:** The image provides a clear, formal method for mapping natural language arguments onto logical structures to identify where the reasoning breaks down. It emphasizes that fallacies often occur in the *relationship* between statements (the labeled nodes), not necessarily in the truth of the individual statements themselves. </details> Figure 1: Examples of logical fallacy sentences and their logical structure trees. The logical structure tree features logical relation connectives as non-terminal nodes, and textual arguments as terminal nodes. Logical fallacy refers to the use of invalid or flawed reasoning in an argumentation Risen et al. (2007); Walton (2010); Cotton (2018). Logical fallacy can occur as unintentional mistakes or deliberate persuasions in a variety of human communications, such as news media Da San Martino et al. (2019), educational essay Jin et al. (2022), political debates Goffredo et al. (2023); Mancini et al. (2024), or online discussions Sahai et al. (2021). Logical fallacies can lead to harmful consequences for society, such as spreading misinformation Musi and Reed (2022); Lundy (2023), raising public health risks Lin et al. (2020), manipulating public opinions Barclay (2018); Lei and Huang (2022); Lei et al. (2024a), introducing societal bias and polarization Abd-Eldayem (2023). Despite their prevalence and harmfulness, understanding logical fallacies still remains a challenging task, which requires both semantics understanding and logical reasoning Li et al. (2022); Sanyal et al. (2023). In this paper, we focus on fallacy detection and classification, and aim to develop an approach that generalizes across different domains and genres. The key observation is that logical fallacies heavily rely on connective phrases to indicate an intended logical relation between two textual arguments, while the semantics of the arguments do not actually support the claimed logical relation. Figure 1 shows two examples where the connective phrases were bolded. The first example uses the connective words therefore and cause to suggest a causal relation between vaccinations and increasing flu cases, however, the temporal relation between the two events as stated in the first half of the statement does not necessarily entail a causal relation between them, and indeed, their semantics do not actually support the suggested causal relation. Recognizing this discrepancy undermines the credibility of the whole statement. Similarly in the second example, the connective word likewise is commonly used to indicate an analogy relation, however, the second argument is clearly a specific case of the general condition stated in the first argument and therefore there is no analogy relation between them, and recognizing this mismatch between the suggested logical relation and the real relation enables us to detect this fallacy. Therefore, we propose to construct a logical structure tree that organizes all connective phrases in a statement and their textual arguments into a hierarchical structure. We expect the logical structure tree to effectively capture the juxtaposition of connective phrase suggested logical relations and the real logical relations between textual arguments, and therefore guide LLMs in fallacy detection and classification. Specifically, a logical structure tree consists of relation connectives as non-terminal nodes and textual arguments as terminal nodes, and the latter mostly corresponds to elementary discourse units (EDU) considered in discourse parsing. Figure 1 shows the logical structure trees constructed for the two example texts. As the logical relation indicated by a connective phrase may not be supported by semantics of its arguments in the context, we identify the purposefully indicated logical relations in a context-free unsupervised manner by matching a connective phrase with a taxonomy of connectives compiled for ten common logical relations (conjunction, alternative, restatement, instantiation, contrast, concession, analogy, temporal, condition, causal). To construct a logical structure tree, we first construct a constituency tree for a statement and then search in the constituency tree for connective phrases in the top-down left to right order, and the first found connective phrase will be the root node of the logical structure tree. Next, we identify the text spans of its two arguments using rules and recursively build the left and right sub-trees by applying the same procedure to constituency tree segments corresponding to the two arguments. The logical structure tree is integrated into LLMs for fallacy reasoning using two strategies. The first considers textualized tree, where we convert the tree into natural language descriptions, making the tree readable by LLMs. Particularly, we describe the relations and arguments in a bottom-up manner, providing the LLMs with insight into logical relations from a local to global perspective. We then concatenate the textualized tree with the instruction prompt, and input them into LLMs as a hard prompt. The second considers tree-based soft prompt, where we derive a relation-aware tree embedding. Specifically, we design relation-specific encoders to process each type of relation and incrementally derive the tree embedding from bottom up to the root node. We then insert the tree embedding into LLMs as a soft prompt for further tuning. Experiments on benchmark datasets across various domains and genres validate that our approach based on logical structure tree effectively improve precision and recall for both fallacy detection and fallacy classification tasks. Our main contributions are summarized as follows: - We propose to construct a logical structure tree to capture the juxtaposition of connective phrase suggested logical relations and the real logical relations between textual arguments, and use it to serve as additional guidance for fallacy detection and classification. - We effectively improve the F1 score for fallacy detection by up to 3.45% and fallacy classification by up to 6.75% across various datasets. ## 2 Related Work Logical Fallacy is erroneous patterns of reasoning Walton (1987); Fantino et al. (2003). Initial work explored the taxonomy of fallacies Tindale (2007); Greenwell et al. (2006); Walton et al. (2008). Recent works have focused on the automatic detection and classification of fallacies. Habernal et al. (2017) developed a software that deals with fallacies in question-answering. Sheng et al. (2021) investigated ad hominem fallacy in dialogue responses. Habernal et al. (2018) explored the ad hominem fallacy from web argumentations. Stab and Gurevych (2017) recognized insufficient arguments in argumentation essays. Goffredo et al. (2022) categorized fallacies in political debates. Nakpih and Santini (2020) focused on fallacies in legal argumentations. Musi et al. (2022) researched fallacies about pandemics on social medias. Alhindi et al. (2022) proposed a multi-task prompting approach to learn the fallacies from multiple datasets jointly. Jin et al. (2022) proposed a structure-aware method to classify fallacies. Different from Jin et al. (2022) that masked out content words to form a sequence-based pattern, our paper proposes a tree-based hierarchical logical structure to unify both relation connectives and content arguments together. Logical Reasoning abilities of large language models are gaining increasing research attention Xu et al. (2023); Chen et al. (2021); Creswell et al. (2022); Pi et al. (2022); Jiao et al. (2022); Zhou et al. (2023); Sanyal et al. (2023); Parmar et al. (2024). Olausson et al. (2023) combined large language models with first-order logic. Pan et al. (2023); Zhang et al. (2023) empowered large language models with symbolic solvers. Pi et al. (2022) presented an adversarial pre-training framework to improve logical reasoning. Zhao et al. (2023) incorporated multi-step explicit planning into the inference procedure. Jiao et al. (2022) proposed a contrastive learning approach to improve logical question-answering. Different from these previous work, we particularly focus on logical fallacy reasoning, aiming to detect and classify fallacies. Misinformation refers to the unverified or false information Guess and Lyons (2020); Armitage and Vaccari (2021); Aïmeur et al. (2023); Lei et al. (2024b). Misinformation detection was studied for years, such as fake news Rashkin et al. (2017); Lei and Huang (2023b); Oshikawa et al. (2020), rumor Ma et al. (2018); Li et al. (2019), satire Yang et al. (2017), political bias Lei et al. (2022); Feng et al. (2023); Devatine et al. (2023); Lei and Huang (2024), propaganda Da San Martino et al. (2019, 2020); Lei and Huang (2023a). Logical fallacies are often employed within misinformation to present invalid claim as credible, facilitating the spread of misinformation Beisecker et al. (2024); Pauli et al. (2022); Bonial et al. (2022). Developing automatic models to detect logical fallacies can also benefit the identification and mitigation of misinformation. | Logical Relations | Relation Connectives | | --- | --- | | conjunction | and, as well as, as well, also, separately | | alternative | or, either, instead, alternatively, else, nor, neither | | restatement | specifically, particularly, in particular, besides, additionally, in addition, moreover, furthermore, plus, not only, indeed, in other words, in fact, in short, in the end, overall, in summary, in details | | instantiation | for example, for instance, such as, including, as an example, an as instance, for one thing | | contrast | but, however, yet, while, unlike, rather, rather than, in comparison, by comparison, on the other hand, on the contrary, contrary to, in contrast, by contrast, whereas, conversely, not, no, none, nothing, n’t | | concession | although, though, despite, despite of, in spite of, regardless, regardless of, nevertheless, nonetheless, even if, even though, even as, even when, even after, even so, no matter | | analogy | likewise, similarly, as if, as though, just as, just like, namely | | temporal | during, before, after, when, as soon as, then, next, until, till, meanwhile, in turn, meantime, afterwards, simultaneously, at the same time, beforehand, previously, earlier, later, thereafter, finally, ultimately | | condition | if, as long as, unless, otherwise, except, whenever, whichever, once, only if, only when, depend on | | causal | because, cause, as a result, result in, due to, therefore, hence, thus, thereby, since, now that, consequently, in consequence, in order to, so as to, so that, why, for, accordingly, given, turn out | Table 1: The ten types of logical relations and their relation connectives. ## 3 Logical Structure Tree The logical structure tree consists of relation connectives as non-terminal nodes, and textual arguments as terminal nodes. The relation connectives serve as parent nodes, and the two corresponding arguments are linked as left and right children nodes. Figure 1 illustrates examples of the logical structure tree. The logical structure tree is constructed in an unsupervised manner, guided by the constituency tree and a taxonomy of connectives complied for ten common logical relations. ### 3.1 Relation Connectives The logical fallacies usually rely on relation connectives to indicate a logical relation. Inspired by the discourse relations proposed by Prasad et al. (2008), we define a taxonomy of ten logical relations which are commonly seen: conjunction, alternative, restatement, instantiation, contrast, concession, analogy, temporal, condition, and causal relations. Moreover, we build a set of connective words and phrases that correspond to each type of logical relation, as shown in Table 1. This set of connectives includes the explicit discourse connectives from the PDTB discourse relation dataset Prasad et al. (2008), and is further expanded by manually adding relevant connectives from the development set of the logic fallacy dataset Jin et al. (2022). We further conduct a statistical analysis on the distribution of ten logical relations and compare distributions between fallacy and no fallacy classes as well as across different fallacy classes, with the detailed results shown in Appendix A. The statistical analysis shows that both the fallacy and no fallacy classes contain many connective phrases and their distributions of the ten logical relations are also very similar. But as expected, different fallacy types tend to employ varying logical patterns, for example, False Dilemma uses more alternative relation, while Deductive Fallacy uses more analogy relation. ### 3.2 Tree Construction Algorithm To construct a logical structure tree $T_{logic}$ , we first construct a constituency tree $T_{con}$ for a statement. We use the stanza library https://stanfordnlp.github.io/stanza/constituency.html to get the constituency tree Qi et al. (2020). At the beginning, $T_{logic}$ is initialized as an empty tree. Then we traverse the constituency tree $T_{con}$ from top to bottom and from left to right, and match relation connectives within each subtree of $T_{con}$ . If there is a subtree $S_{con(w)}$ whose text equals to a relation connective $w$ , we use the algorithm in section 3.3 to extract the two textual arguments $\alpha,\beta$ associated with $w$ . Then a new logical subtree $S_{logic(w)}$ is created, with the matched relation connective $w$ as a parent node, and the two arguments $\alpha,\beta$ as its left and right children. This new logical subtree $S_{logic(w)}$ is added into the logical structure tree $T_{logic}$ . If the textual arguments $\alpha,\beta$ still contain other relation connectives, then we recursively match relation connectives in the arguments and replace the original argument node in the $T_{logic}$ with the newly created logical subtree. The termination condition is that all the relation connectives in the given text have been matched. ### 3.3 Textual Arguments Extraction The textual arguments are the two content components linked by a relation connective. Given a matched relation connective $w$ , its corresponding subtree in the $T_{con}$ is $S_{con(w)}$ . To extract the arguments of $w$ , we find the parent tree of $S_{con(w)}$ in the $T_{con}$ , denoted as $P(S_{con(w)})$ . The text enclosed by $P(S_{con(w)})$ is the concatenation of all its leaf node texts. If the text enclosed by parent tree $P(S_{con(w)})$ contains content before and after the relation connective $w$ , i.e., has the form of $\alpha+w+\beta$ , then the left argument of $w$ is $\alpha$ and the right argument is $\beta$ . If the text enclosed by parent tree $P(S_{con(w)})$ only contains content after the relation connective $w$ , i.e., has the form of $w+\beta$ , then the right argument of $w$ is $\beta$ , and the left argument $\alpha$ is the text enclosed by grandparent tree $P(P(S_{con(w)}))$ subtracted by the text enclosed by $P(S_{con(w)})$ . ## 4 Logical Fallacy Reasoning We further design a framework to incorporate the logical structure tree into LLMs for fallacy detection and classification. This framework consists of two main components. The first is textualized tree, where we convert the logical structure tree into natural language descriptions, and feed it into LLMs as a hard text prompt. The second is tree-based soft prompt, where we derive a relation-aware tree embedding, and insert it into LLMs as a soft prompt for additional tuning. The hard and soft prompts are complementary: the hard prompt enriches the instruction with logical structure information, while the soft prompt facilitates direct tuning on tree embeddings. Figure 2 shows an illustration. <details> <summary>x2.png Details</summary>  ### Visual Description ## Diagram: Fallacy Classification Pipeline ### Overview The image is a technical flowchart illustrating a two-pathway pipeline for classifying logical fallacies in text. The system combines symbolic logical structure analysis with a Large Language Model (LLM) to produce a final "Fallacy Type" classification. The process begins with an instruction prompt and raw "Fallacy Text," processes it through parallel structural and embedding pathways, and converges in an LLM for final prediction. ### Components/Axes The diagram is organized into several distinct regions and components: 1. **Instruction Prompt (Top Region):** * **Text:** "Instruction prompt: Please classify the fallacy type of the Text. Choose one answer from these fallacy types: <fallacy types list>. The definitions of each fallacy type are as follows: <fallacy types definition>. Text: <fallacy text>." * **Function:** This text block defines the core task and provides the template for the input to the final LLM component. It uses placeholders (`<...>`) for dynamic content. 2. **Input (Leftmost Element):** * **Label:** "Fallacy Text" * **Function:** The raw text input containing a potential logical fallacy to be analyzed. 3. **Pathway 1: Symbolic Logical Structure Processing (Upper-Middle Region):** * **Component 1:** "Logical Structure Tree Construction" * **Input:** "Fallacy Text" * **Output:** A tree diagram with nodes (blue circles) and directed edges (green arrows). Labels on the edges include "logical relation connectives." The leaf nodes are labeled "left argument" and "right argument." * **Component 2:** "Tree Textualization" * **Input:** The constructed logical tree. * **Output:** A dashed green box labeled "Textualized Tree." Inside, it lists a template and examples: * "left argument, logical connective, right argument" * "xxx, as long as, xxx" * "xxx, likewise, xxx" 4. **Pathway 2: Neural Embedding Processing (Lower-Middle Region):** * **Component 1:** "Tree Encoder" * **Input:** The same logical structure tree from Pathway 1. * **Output:** "Tree Embedding" (represented by a vertical column of four circles). * **Component 2:** "Projection Layer" * **Input:** "Tree Embedding" * **Output:** "Tree-based Soft Prompt" (another vertical column of four circles). 5. **Convergence & LLM Processing (Right Region):** * **Component 1:** "LLM Text Embedder" * **Inputs:** 1. The original "Instruction prompt" (from the top). 2. The "Textualized Tree" from Pathway 1. * **Component 2:** "LLM Self Attention Layers" * **Input:** The output from the "LLM Text Embedder." * **Additional Input:** The "Tree-based Soft Prompt" from Pathway 2. * **Final Output:** An arrow points from the "LLM Self Attention Layers" to the label "Fallacy Type." ### Detailed Analysis The diagram details a sophisticated hybrid architecture: * **Flow Direction:** The process flows from left to right. The initial "Fallacy Text" splits into two parallel processing streams that later merge. * **Pathway 1 (Symbolic):** Converts raw text into an explicit logical tree structure, then converts that tree back into a structured textual format ("Textualized Tree"). This path emphasizes interpretable, rule-based logical relationships. * **Pathway 2 (Neural):** Encodes the same logical tree into a dense vector representation ("Tree Embedding") and projects it into a "Soft Prompt." This path creates a continuous, model-ready representation of the logical structure. * **Integration:** Both pathways feed into a central LLM. The "Textualized Tree" is combined with the instruction prompt and embedded. Crucially, the "Tree-based Soft Prompt" is injected directly into the LLM's self-attention layers, suggesting it acts as a guiding signal or bias for the model's processing of the textual input. ### Key Observations 1. **Dual Representation:** The system explicitly maintains two representations of the logical structure: a human-readable textual form and a machine-optimized embedding form. 2. **Soft Prompting:** The use of a "Tree-based Soft Prompt" indicates a parameter-efficient tuning method, where the logical structure influences the LLM without modifying its core weights. 3. **Placeholder Syntax:** The instruction prompt uses clear placeholders (`<fallacy types list>`, `<fallacy text>`), indicating this is a template for a dynamic system. 4. **Visual Coding:** Green is used for the logical structure pathway (tree edges, textualization box), while blue is used for nodes and the LLM components, creating a visual distinction between the symbolic and neural elements. ### Interpretation This diagram represents a neuro-symbolic approach to a complex NLP task. The core innovation is the dual use of logical structure: 1. **Explicit Guidance:** By textualizing the logical tree, the system provides the LLM with a clean, structured representation of the argument's form, potentially making fallacies more detectable than in raw, noisy text. 2. **Implicit Guidance:** The soft prompt derived from the tree embedding likely steers the LLM's internal attention mechanisms to focus on the logically salient parts of the input text as defined by the constructed tree. The pipeline suggests that pure LLM reasoning on fallacy text may be insufficient or unreliable. By first parsing the text into a formal logical structure and then using that structure to condition the LLM's processing, the system aims to achieve more accurate, robust, and potentially interpretable fallacy classification. The architecture implies that the *form* of an argument (its logical skeleton) is as important as its *content* (the specific words used) for identifying reasoning errors. </details> Figure 2: An illustration of logical fallacy classification informed by logical structure tree. ### 4.1 Textualized Tree The textualized tree aims to transform the logical structure tree into the textual form, which can be interpretable by LLMs. As shown by the upper path of Figure 2, the textualized tree is represented as a table which consists of three columns: left argument, relation connective, right argument. Each row in the table represents a triplet (left argument, relation connective, right argument) corresponding to each logical relation in the tree. In particular, we organize the triplets into the table in a bottom-up order, to provide the LLMs with insight into logical relations from a micro to macro perspective. The textualized tree is then input into the LLMs as a part of the hard text promt: $$ h_{t}=TextEmbedder\Bigl{(}textualize(T_{logic})\Bigr{)} \tag{1} $$ where $textualize(\cdot)$ denotes the textualization operation, $TextEmbedder$ reders to the text embedding layer of LLMs, $h_{t}$ is the mapped embedding of the textualized tree. ### 4.2 Tree-based Soft Prompt The tree-based soft prompt is a tree embedding which is projected into LLMs as a soft prompt for further tuning. As shown by the lower path pf Figure 2, this process includes a tree encoder to derive the tree embedding, as well as a projection layer to transform the tree embedding into the same representation space of LLMs. During the tree encoder stage, we aim to derive a relation-aware tree embedding. To integrate relation information into tree embedding, we design relation-specific encoders to process each type of logical relation. For a simple tree whose children nodes are leaf nodes without hierarchical layers, its embedding is computed as: $$ e_{s}=W^{r}(e_{l}\oplus e_{c}\oplus e_{r})+b^{r} \tag{2} $$ where $e_{s}$ is the embedding of this simple tree, $e_{l}$ , $e_{c}$ , $e_{r}$ are the embeddings of left argument, relation connective, and right argument, which are initialized as the average of word embeddings derived from RoBERTa language model Liu et al. (2019), $\oplus$ denotes feature concatenation, $W^{r}$ , $b^{r}$ are the trainable parameters of the encoder that corresponds to the relation type $r$ , where $W^{r}\in R^{3d\times d}$ , $b^{r}\in R^{d}$ , and $d=768$ is the dimension of embedding space in RoBERTa. The relation type $r$ is one of the ten logical relations associated with the relation connective. For the tree with hierarchical structure, we derive the tree embedding incrementally, starting from the bottom simple tree and up towards the root node: $$ e_{t}=W^{r}(\hat{e_{l}}\oplus e_{c}\oplus\hat{e_{r}})+b^{r} \tag{3} $$ where $e_{t}$ is the tree embedding, $\hat{e_{l}}$ is the embedding of the left subtree, $\hat{e_{r}}$ is the embedding of the right subtree, $e_{c}$ is the connective embedding. During the projection stage, we transform the tree embedding $e_{t}$ into the same representation space of LLMs through a projection layer, which includes two layers of neural networks: $$ \hat{e_{t}}=W_{2}\Bigl{(}W_{1}e_{t}+b_{1}\Bigr{)}+b_{2} \tag{4} $$ where $W_{1}$ , $W_{2}$ , $b_{1}$ , $b_{2}$ are the trainable parameters of the projection layer, $W_{1}\in R^{d\times d^{\prime}}$ , $W_{2}\in R^{d^{\prime}\times d^{\prime}}$ , $b_{1},b_{2}\in R^{d^{\prime}}$ , $d$ is dimension of hidden states in RoBERTa, $d^{\prime}$ is the dimension of embedding space of the target LLM. $\hat{e_{t}}$ is the resulting tree-based soft prompt, which is then inserted into LLMs as a token representation within the input sequence. ### 4.3 Fallacy Training The LLMs take the instruction prompt, textualized tree $h_{t}$ , and tree-based soft prompt $\hat{e_{t}}$ as input, and generate fallacy label as output. The loss is calculated between the generated text and golden label. The text embedding layer and self attention layers of LLMs are frozen. The tree-based soft prompt $\hat{e_{t}}$ receives gradients and enables back propagation. $$ T_{logic} T_{logic} T_{logic} T_{logic} \tag{2021} $$ Table 2: The results of logical fallacy detection on three datasets. The precision, recall, F1 score of fallacy class, and accuracy are reported. The rows "+ $T_{logic}$ " represent incorporating the logical structure tree into the model. | Dataset | Train | Dev | Test | Fallacy | Benign | Types | | --- | --- | --- | --- | --- | --- | --- | | Argotario | 863 | 201 | 267 | 909 | 422 | 5 | | Reddit | 2313 | 668 | 335 | 1691 | 1625 | 8 | | Climate | 436 | 114 | 133 | 477 | 206 | 9 | | Logic | 1849 | 300 | 300 | 2449 | - | 13 | Table 3: The number of samples in train/dev/test set, the number of fallacy and no fallacy (benign) samples, and the number of fallacy types in each dataset. ## 5 Experiments ### 5.1 Datasets We experiment with four datasets from various domains and genres. Table 3 shows their statistics. Argotario Habernal et al. (2017) collects fallacies from the general domain question-answering pairs. The dataset includes the following fallacy labels: Ad Hominem, Appeal to Emotion, Hasty Generalization, Irrelevant Authority, Red Herring, and No Fallacy. We use this dataset for both fallacy detection and classification experiments, and follow the dataset splitting method in Alhindi et al. (2022). Reddit Sahai et al. (2021) collects user generated posts from Reddit, and annotates logical fallacies into: Slippery Slope, Irrelevant Authority, Hasty Generalization, Black-and-White Fallacy, Ad Populum, Tradition Fallacy, Naturalistic Fallacy, Worse Problem Fallacy, and No Fallacy. This dataset is used for both fallacy detection and classification. Climate Alhindi et al. (2022) collects statements from articles in the climate change domain, and annotated the following fallacies: Evading the Burden of Proof, Cherry Picking, Red Herring, Strawman, Irrelevant Authority, Hasty Generalization, False Cause, False Analogy, Vagueness, and No Fallacy. Logic Jin et al. (2022) annotates logical fallacies in the educational materials into 13 types including Ad Hominem, Ad Populum, False Dilemma, False Cause, Circular Reasoning, Deductive Fallacy, Appeal to Emotion, Equivocation, Fallacy of Extension, Faulty Generalization, Intentional Fallacy, Fallacy of Credibility, Fallacy of Relevance. This dataset does not include No Fallacy class and is only used for fallacy classification. ### 5.2 Experimental Settings To validate our approach, we experiment on two types of language models: a decoder-only model and an encoder-decoder model. For the decoder-only model, we choose the open-source large language model Llama-2 (llama-2-7b-chat-hf) Touvron et al. (2023). For the encoder-decoder model, we choose the Flan-T5-large model Chung et al. (2022). Both the models are trained in a generative setting, where they take the instruction and given text as input, and generate a fallacy label as output. The fallacy detection task generates "Yes" or "No" label as output, while the fallacy classification task generates the name of each fallacy type. We follow Alhindi et al. (2022) to unify the different names of the same fallacy across datasets, such as False Dilemma is converted into Black-and-White Fallacy since they are the same fallacy. We also follow Alhindi et al. (2022) to feed the definitions of each fallacy type into the instruction prompt. The details of instruction prompt are explained in Appendix B. The maximum input length is set to be 1024, number of epochs is 10, weight decay is 1e-2, the gradient accumulation step is 4, learning rate for Llama-2 is 3e-4, and learning rate for Flan-T5 is 3e-5. The Llama-2 model is trained with LoRA Hu et al. (2021), with rank 8, alpha 16, dropout 0.05, and trainable modules include q_proj and v_proj. $$ T_{logic} T_{logic} T_{logic} T_{logic} \tag{2022} $$ Table 4: The results of logical fallacy classification on three datasets. The macro precision, recall, F1 score, and accuracy are reported. The rows "+ $T_{logic}$ " represent incorporating the logical structure tree into the model. ### 5.3 Baselines We compare our models with the baselines listed below. Besides the existing baselines, we also implement several additional baselines based on the GPT and RoBERTa Liu et al. (2019) models: Sahai et al. (2021): a multi-granularity network is designed that trains sentence-level representation and the token-level representations jointly. Jin et al. (2022): a structure-aware framework is developed that forms a sequence-based logical pattern for each text by masking out the content words. Sourati et al. (2023b): a prototype-based reasoning method that injects background knowledge and explainable mechanisms into the language model. Sourati et al. (2023a): a case-based reasoning that retrieves similar cases from external sources based on goals, counterarguments, and explanation etc. Alhindi et al. (2022): a multi-task instruction tuning framework that learns the logical fallacies from multiple datasets collaboratively. GPT-3.5: we prompt the gpt-3.5-turbo model to automatically choose one of the fallacy labels for each text, and the prompt is listed in Appendix C. GPT-3.5 + $T_{logic}$ : guide the gpt-3.5-turbo model to firstly reason the logical structure of each text, and then choose one of the fallacy labels through a chain-of-thought process Wei et al. (2023). RoBERTa: the RoBERTa model is used to encode the text and the average of word embedding is used as the text embedding. A classification head is built on top of the text embedding to classify labels. RoBERTa + $T_{logic}$ : we concatenate the text embedding with the logical structure tree embedding, and build classification head on top of the combined embedding to predict labels. The tree embedding is derived based on the method in Section 4.2. ### 5.4 Fallacy Detection The fallacy detection task identifies whether a given text contains logical fallacy or not, which is a binary classification task. The precision, recall, and F1 score of the fallacy class, as well as the micro F1 score (i.e., accuracy) are used as evaluation metrics. Table 2 presents the performance on the Argotario, Reddit, and Climate datasets. The results demonstrate that incorporating the logical structure tree effectively improves both precision and recall for logical fallacy detection. This observation is consistent for both types of Llama-2 and Flan-T5 models across all the three datasets, which span various domains and genres. Compared to the baselines that lack logical structure information, our approach based on the logical structure tree noticeably enhances the precision and recall, leading to the F1 score increased by up to 3.45%. This indicates that the logical structure tree is effective in capturing the difference in logical flows between fallacious and benign texts. Moreover, informing the large language model GPT-3.5-turbo of logical structure information significantly improves fallacy detection under the zero-shot setting, resulting in a substantial improvement in the F1 score. This underscores the importance of integrating the logical structure information into LLMs for fallacy detection. Also, concatenating the logical structure tree embedding with the text embedding in the RoBERTa model also enhances the performance, which proves the usefulness of this logical structure tree embedding. Overall, incorporating the logical structure tree helps improve fallacy detection for various types of models. | | Argotario | Reddit | Climate | | | | | | | | | | | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | | Fallacy Detection | Precision | Recall | F1 | Acc | Precision | Recall | F1 | Acc | Precision | Recall | F1 | Acc | | Llama-2 | 83.52 | 83.98 | 83.75 | 77.90 | 68.53 | 79.41 | 73.57 | 70.96 | 68.80 | 93.48 | 79.26 | 66.16 | | + textualized tree | 85.25 | 86.19 | 85.71 | 80.52 | 69.54 | 80.12 | 74.46 | 71.94 | 68.70 | 97.83 | 80.72 | 67.67 | | + tree-based soft prompt | 85.11 | 88.40 | 86.72 | 81.65 | 69.42 | 83.63 | 75.86 | 72.84 | 68.94 | 98.91 | 81.25 | 68.42 | | + both (full model) | 86.02 | 88.40 | 87.19 | 82.40 | 70.05 | 84.80 | 76.72 | 73.73 | 69.17 | 100.00 | 81.78 | 69.17 | | Argotario | Reddit | Logic | | | | | | | | | | | | Fallacy Classification | Precision | Recall | F1 | Acc | Precision | Recall | F1 | Acc | Precision | Recall | F1 | Acc | | Llama-2 | 60.79 | 58.71 | 59.20 | 59.67 | 77.87 | 77.16 | 77.21 | 77.19 | 65.52 | 63.38 | 63.05 | 69.36 | | + textualized tree | 62.63 | 61.32 | 61.86 | 61.67 | 80.98 | 80.71 | 80.45 | 80.59 | 68.71 | 66.09 | 66.38 | 71.24 | | + tree-based soft prompt | 64.34 | 61.89 | 62.30 | 62.98 | 82.87 | 82.57 | 82.30 | 82.35 | 68.75 | 68.72 | 67.52 | 72.58 | | + both (full model) | 65.63 | 63.29 | 63.92 | 64.09 | 84.84 | 83.68 | 83.95 | 83.63 | 70.70 | 70.03 | 69.55 | 74.16 | Table 5: The results of ablation study. The precision, recall, F1 score of fallacy class are reported for fallacy detection (upper rows). The macro precision, recall, F1 score are reported for fallacy classification (lower rows). | | Ad Hominem | Emotional | Generalization | Authority | Red Herring | Macro F1 | | --- | --- | --- | --- | --- | --- | --- | | Llama-2 | 60.79 | 67.33 | 55.38 | 63.16 | 49.35 | 59.20 | | Llama-2 + $T_{logic}$ | 63.16 | 72.16 | 61.29 | 67.80 | 55.17 | 63.92 | Table 6: The F1 score change across each fallacy type of fallacy classification on Argotario dataset. The fallacy types include Ad Hominem, Emotional Language, Hasty Generalization, Irrelevant Authority, and Red Herring. | | Slippery | Authority | Generalization | Black-White | Ad Populum | Tradition | Naturalistic | Worse Problem | Macro F1 | | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | | Llama-2 | 86.96 | 82.05 | 69.57 | 63.41 | 68.29 | 81.82 | 90.00 | 75.56 | 77.21 | | Llama-2 + $T_{logic}$ | 88.89 | 92.31 | 77.27 | 65.22 | 82.93 | 87.18 | 95.25 | 82.61 | 83.95 | Table 7: The F1 score change across each fallacy type of fallacy classification on Reddit dataset. The fallacy types include Slippery Slope, Irrelevant Authority, Hasty Generalization, Black-and-White Fallacy, Ad Populum, Tradition Fallacy, Naturalistic Fallacy, and Worse Problem Fallacy. | | Ad Hominem | Ad Populum | False Dilemma | False Cause | Circular | Deductive | Emotional | | --- | --- | --- | --- | --- | --- | --- | --- | | Llama-2 | 82.35 | 72.41 | 78.57 | 68.42 | 61.90 | 62.07 | 66.67 | | Llama-2 + $T_{logic}$ | 80.46 | 87.50 | 78.57 | 66.67 | 75.68 | 66.67 | 65.22 | | Equivocation | Extension | Generalization | Intentional | Authority | Relevance | Macro F1 | | | Llama-2 | 25.00 | 60.00 | 78.13 | 34.48 | 64.71 | 65.00 | 63.05 | | Llama-2 + $T_{logic}$ | 44.44 | 72.22 | 81.03 | 38.71 | 68.97 | 78.05 | 69.55 | Table 8: The F1 score change across each fallacy type of fallacy classification on Logic dataset. The fallacy types include Ad Hominem, Ad Populum, False Dilemma (Black-and-White Fallacy), False Cause, Circular Reasoning, Deductive Fallacy, Appeal to Emotion (Emotional Language), Equivocation, Fallacy of Extension, Faulty Generalization (Hasty Generalization), Intentional Fallacy, Fallacy of Credibility (Irrelevant Authority), Fallacy of Relevance (Red Herring). ### 5.5 Fallacy Classification The fallacy classification task classifies the fallacy types for the fallacious text, which is a multi-class classification task excluding the No Fallacy class. The macro precision, recall, and F1 score, as well as the micro F1 score (i.e., accuracy) are used as evaluation metrics. Table 4 shows the results on the Argotario, Reddit, and Logic datasets. The results demonstrate that integrating the logical structure tree into Llama-2 and Flan-T5 models notably enhances the performance of fallacy classification, with both precision and recall increased. This conclusion is valid across the three datasets from different domains and genres. Compared to the baselines without logical structure tree, our proposed approach significantly improves precision and recall, leading to an increase of up to 6.75% in the F1 score. This suggests that the logical structure tree effectively distinguishes the different logical patterns used in each fallacy type, and is applicable across various domains and genres. In addition, our approach based on the logical structure tree outperforms the previous methods that may lack logical relations information. This highlights the necessity to infuse the logical relations into LLMs for fallacy classification. Besides, our approach achieves higher performance than the baselines that overlook content words. This indicates that analyzing content words also plays an essential role in fallacy reasoning. The logical structure tree connects the logical relations and content arguments together to form a cohesive logical structure, representing the hierarchical logical flow and thereby improving fallacy classification. ### 5.6 Ablation Study The ablation study of the two designed strategies to incorporate the logical structure tree into LLMs is shown in Table 5, where we take Llama-2 model as an example. The upper rows show the results of fallacy detection on the three datasets, and the lower rows show the results of fallacy classification. The results demonstrate that both the textualized tree and tree-based soft prompt brings improvement for fallacy detection and classification across multiple datasets. This proves that the textualized tree and tree-based soft prompt are complementary with each other: the textualized tree enriches the instruction prompt with logical structure information, and the tree-based soft prompt enables direct learning from the tree embedding. Comparing across these two strategies, the soft prompt usually achieves better performance than the hard text prompt, and exhibits higher recall. Combining the two strategies together leads to the best performance, achieving the highest precision and recall. ### 5.7 Effect on Different Fallacy Types We further analyze the F1 score change across each fallacy type in the fallacy classification task. The Llama-2 model is used as an example to show the performance change before and after incorporating the logical structure tree. Table 6 presents the F1 score change across each fallacy type on Argotario dataset. The performance change across each fallacy type on the Reddit and Logic dataset are shown in the Table 7 and Table 8. We observe that the logical structure tree brings bigger improvements for the fallacy types such as Red Herring, Hasty Generalization, Irrelevant Authority, Ad Populum, Extension Fallacy, Equivocation, Circular Reasoning etc. One possible explanation is that these fallacy types usually employ certain logical relations or logical patterns to persuade the readers. However, the performance increase is less noticeable for the fallacy types such as Appeal to Emotion and Ad Hominem. It may due to the reason that these fallacies rely more on the emotional or sentimental language instead of logical relations. ## 6 Limitations We have compiled a set of connective words and phrases for the ten logical relations, as detailed in Table 1. While we have included the common connectives in this set, it may not contain all the possible connectives. The logical structure tree that is constructed based on this connective words set demonstrates its usefulness in fallacy reasoning. Future work can be expanding this connectives set and investigating the effects of various connectives. ## 7 Conclusion This paper detects and classifies fallacies. We propose a logical structure tree to explicitly represent and track the hierarchical logic flow among relation connectives and their arguments. We also design two strategies to incorporate this logical structure tree into LLMs for fallacy reasoning. Extensive experiments demonstrate the effectiveness of our approach based on the logical structure tree. ## Ethical Considerations This paper aims to detect and classify logical fallacies. Logical fallacy is the error or flaws in the reasoning, and can occur in various human communications. Logical fallacies can lead to harmful consequences for society, such as spreading misinformation or introducing societal bias. The goal of this research is to understand logical fallacies, so that we can better identify and mitigate them. The release of code, datasets, and model should be used for mitigating logical fallacies, instead of expanding or disseminating the misinformation. ## Acknowledgements We would like to thank the anonymous reviewers for their valuable feedback and input. We gratefully acknowledge support from National Science Foundation via the award IIS2127746. Portions of this research were conducted with the advanced computing resources provided by Texas A&M High-Performance Research Computing. ## References - Abd-Eldayem (2023) Rehab Mohamed Ahmed Abd-Eldayem. 2023. The relationship between cognitive bias and logical fallacies in egyptian society. Social Sciences, 12(6):281–293. - Aïmeur et al. (2023) Esma Aïmeur, Sabrine Amri, and Gilles Brassard. 2023. Fake news, disinformation and misinformation in social media: a review. Social Network Analysis and Mining, 13(1):30. - Alhindi et al. (2022) Tariq Alhindi, Tuhin Chakrabarty, Elena Musi, and Smaranda Muresan. 2022. Multitask instruction-based prompting for fallacy recognition. In Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing, pages 8172–8187, Abu Dhabi, United Arab Emirates. Association for Computational Linguistics. - Armitage and Vaccari (2021) Rachel Armitage and Cristian Vaccari. 2021. Misinformation and disinformation. In The Routledge companion to media disinformation and populism, pages 38–48. Routledge. - Barclay (2018) Donald A Barclay. 2018. Fake news, propaganda, and plain old lies: how to find trustworthy information in the digital age. Rowman & Littlefield. - Beisecker et al. (2024) Sven Beisecker, Christian Schlereth, and Sebastian Hein. 2024. Shades of fake news: How fallacies influence consumers’ perception. European Journal of Information Systems, 33(1):41–60. - Bonial et al. (2022) Claire Bonial, Austin Blodgett, Taylor Hudson, Stephanie M. Lukin, Jeffrey Micher, Douglas Summers-Stay, Peter Sutor, and Clare Voss. 2022. The search for agreement on logical fallacy annotation of an infodemic. In Proceedings of the Thirteenth Language Resources and Evaluation Conference, pages 4430–4438, Marseille, France. European Language Resources Association. - Chen et al. (2021) Zeming Chen, Qiyue Gao, and Lawrence S. Moss. 2021. NeuralLog: Natural language inference with joint neural and logical reasoning. In Proceedings of *SEM 2021: The Tenth Joint Conference on Lexical and Computational Semantics, pages 78–88, Online. Association for Computational Linguistics. - Chung et al. (2022) Hyung Won Chung, Le Hou, Shayne Longpre, Barret Zoph, Yi Tay, William Fedus, Yunxuan Li, Xuezhi Wang, Mostafa Dehghani, Siddhartha Brahma, Albert Webson, Shixiang Shane Gu, Zhuyun Dai, Mirac Suzgun, Xinyun Chen, Aakanksha Chowdhery, Alex Castro-Ros, Marie Pellat, Kevin Robinson, Dasha Valter, Sharan Narang, Gaurav Mishra, Adams Yu, Vincent Zhao, Yanping Huang, Andrew Dai, Hongkun Yu, Slav Petrov, Ed H. Chi, Jeff Dean, Jacob Devlin, Adam Roberts, Denny Zhou, Quoc V. Le, and Jason Wei. 2022. Scaling instruction-finetuned language models. Preprint, arXiv:2210.11416. - Cotton (2018) Christian Cotton. 2018. Argument from fallacy. Bad arguments: 100 of the most important fallacies in Western philosophy, pages 125–127. - Creswell et al. (2022) Antonia Creswell, Murray Shanahan, and Irina Higgins. 2022. Selection-inference: Exploiting large language models for interpretable logical reasoning. Preprint, arXiv:2205.09712. - Da San Martino et al. (2020) Giovanni Da San Martino, Alberto Barrón-Cedeño, Henning Wachsmuth, Rostislav Petrov, and Preslav Nakov. 2020. SemEval-2020 task 11: Detection of propaganda techniques in news articles. In Proceedings of the Fourteenth Workshop on Semantic Evaluation, pages 1377–1414, Barcelona (online). International Committee for Computational Linguistics. - Da San Martino et al. (2019) Giovanni Da San Martino, Seunghak Yu, Alberto Barrón-Cedeño, Rostislav Petrov, and Preslav Nakov. 2019. Fine-grained analysis of propaganda in news article. In Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP), pages 5636–5646, Hong Kong, China. Association for Computational Linguistics. - Devatine et al. (2023) Nicolas Devatine, Philippe Muller, and Chloé Braud. 2023. An integrated approach for political bias prediction and explanation based on discursive structure. In Findings of the Association for Computational Linguistics: ACL 2023, pages 11196–11211, Toronto, Canada. Association for Computational Linguistics. - Fantino et al. (2003) Edmund Fantino, Stephanie Stolarz-Fantino, and Anton Navarro. 2003. Logical fallacies: A behavioral approach to reasoning. The Behavior Analyst Today, 4(1):109. - Feng et al. (2023) Shangbin Feng, Chan Young Park, Yuhan Liu, and Yulia Tsvetkov. 2023. From pretraining data to language models to downstream tasks: Tracking the trails of political biases leading to unfair NLP models. In Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 11737–11762, Toronto, Canada. Association for Computational Linguistics. - Goffredo et al. (2023) Pierpaolo Goffredo, Mariana Chaves, Serena Villata, and Elena Cabrio. 2023. Argument-based detection and classification of fallacies in political debates. In Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing, pages 11101–11112, Singapore. Association for Computational Linguistics. - Goffredo et al. (2022) Pierpaolo Goffredo, Shohreh Haddadan, Vorakit Vorakitphan, Elena Cabrio, and Serena Villata. 2022. Fallacious argument classification in political debates. In IJCAI, pages 4143–4149. - Greenwell et al. (2006) William S Greenwell, John C Knight, C Michael Holloway, and Jacob J Pease. 2006. A taxonomy of fallacies in system safety arguments. In 24th International System Safety Conference. - Guess and Lyons (2020) Andrew M Guess and Benjamin A Lyons. 2020. Misinformation, disinformation, and online propaganda. Social media and democracy: The state of the field, prospects for reform, 10. - Habernal et al. (2017) Ivan Habernal, Raffael Hannemann, Christian Pollak, Christopher Klamm, Patrick Pauli, and Iryna Gurevych. 2017. Argotario: Computational argumentation meets serious games. In Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing: System Demonstrations, pages 7–12, Copenhagen, Denmark. Association for Computational Linguistics. - Habernal et al. (2018) Ivan Habernal, Henning Wachsmuth, Iryna Gurevych, and Benno Stein. 2018. Before name-calling: Dynamics and triggers of ad hominem fallacies in web argumentation. In Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers), pages 386–396, New Orleans, Louisiana. Association for Computational Linguistics. - Hu et al. (2021) Edward J. Hu, Yelong Shen, Phillip Wallis, Zeyuan Allen-Zhu, Yuanzhi Li, Shean Wang, Lu Wang, and Weizhu Chen. 2021. Lora: Low-rank adaptation of large language models. Preprint, arXiv:2106.09685. - Jiao et al. (2022) Fangkai Jiao, Yangyang Guo, Xuemeng Song, and Liqiang Nie. 2022. MERIt: Meta-Path Guided Contrastive Learning for Logical Reasoning. In Findings of the Association for Computational Linguistics: ACL 2022, pages 3496–3509, Dublin, Ireland. Association for Computational Linguistics. - Jin et al. (2022) Zhijing Jin, Abhinav Lalwani, Tejas Vaidhya, Xiaoyu Shen, Yiwen Ding, Zhiheng Lyu, Mrinmaya Sachan, Rada Mihalcea, and Bernhard Schoelkopf. 2022. Logical fallacy detection. In Findings of the Association for Computational Linguistics: EMNLP 2022, pages 7180–7198, Abu Dhabi, United Arab Emirates. Association for Computational Linguistics. - Lei and Huang (2022) Yuanyuan Lei and Ruihong Huang. 2022. Few-shot (dis)agreement identification in online discussions with regularized and augmented meta-learning. In Findings of the Association for Computational Linguistics: EMNLP 2022, pages 5581–5593, Abu Dhabi, United Arab Emirates. Association for Computational Linguistics. - Lei and Huang (2023a) Yuanyuan Lei and Ruihong Huang. 2023a. Discourse structures guided fine-grained propaganda identification. In Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing, pages 331–342, Singapore. Association for Computational Linguistics. - Lei and Huang (2023b) Yuanyuan Lei and Ruihong Huang. 2023b. Identifying conspiracy theories news based on event relation graph. In Findings of the Association for Computational Linguistics: EMNLP 2023, pages 9811–9822, Singapore. Association for Computational Linguistics. - Lei and Huang (2024) Yuanyuan Lei and Ruihong Huang. 2024. Sentence-level media bias analysis with event relation graph. In Proceedings of the 2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers), pages 5225–5238, Mexico City, Mexico. Association for Computational Linguistics. - Lei et al. (2022) Yuanyuan Lei, Ruihong Huang, Lu Wang, and Nick Beauchamp. 2022. Sentence-level media bias analysis informed by discourse structures. In Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing, pages 10040–10050, Abu Dhabi, United Arab Emirates. Association for Computational Linguistics. - Lei et al. (2024a) Yuanyuan Lei, Md Messal Monem Miah, Ayesha Qamar, Sai Ramana Reddy, Jonathan Tong, Haotian Xu, and Ruihong Huang. 2024a. EMONA: Event-level moral opinions in news articles. In Proceedings of the 2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers), pages 5239–5251, Mexico City, Mexico. Association for Computational Linguistics. - Lei et al. (2024b) Yuanyuan Lei, Kaiqiang Song, Sangwoo Cho, Xiaoyang Wang, Ruihong Huang, and Dong Yu. 2024b. Polarity calibration for opinion summarization. In Proceedings of the 2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers), pages 5211–5224, Mexico City, Mexico. Association for Computational Linguistics. - Li et al. (2019) Quanzhi Li, Qiong Zhang, Luo Si, and Yingchi Liu. 2019. Rumor detection on social media: Datasets, methods and opportunities. In Proceedings of the Second Workshop on Natural Language Processing for Internet Freedom: Censorship, Disinformation, and Propaganda, pages 66–75, Hong Kong, China. Association for Computational Linguistics. - Li et al. (2022) Yitian Li, Jidong Tian, Wenqing Chen, Caoyun Fan, Hao He, and Yaohui Jin. 2022. To what extent do natural language understanding datasets correlate to logical reasoning? a method for diagnosing logical reasoning. In Proceedings of the 29th International Conference on Computational Linguistics, pages 1708–1717, Gyeongju, Republic of Korea. International Committee on Computational Linguistics. - Lin et al. (2020) Timothy PH Lin, Kelvin H Wan, Suber S Huang, Jost B Jonas, David SC Hui, and Dennis SC Lam. 2020. Death tolls of covid-19: where come the fallacies and ways to make them more accurate. Global Public Health, 15(10):1582–1587. - Liu et al. (2019) Yinhan Liu, Myle Ott, Naman Goyal, Jingfei Du, Mandar Joshi, Danqi Chen, Omer Levy, Mike Lewis, Luke Zettlemoyer, and Veselin Stoyanov. 2019. Roberta: A robustly optimized bert pretraining approach. Preprint, arXiv:1907.11692. - Lundy (2023) Morgan Lundy. 2023. Tiktok and covid-19 vaccine misinformation: New avenues for misinformation spread, popular infodemic topics, and dangerous logical fallacies. International Journal of Communication, 17:24. - Ma et al. (2018) Jing Ma, Wei Gao, and Kam-Fai Wong. 2018. Rumor detection on Twitter with tree-structured recursive neural networks. In Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 1980–1989, Melbourne, Australia. Association for Computational Linguistics. - Mancini et al. (2024) Eleonora Mancini, Federico Ruggeri, and Paolo Torroni. 2024. Multimodal fallacy classification in political debates. In Proceedings of the 18th Conference of the European Chapter of the Association for Computational Linguistics (Volume 2: Short Papers), pages 170–178, St. Julian’s, Malta. Association for Computational Linguistics. - Musi et al. (2022) Elena Musi, Myrto Aloumpi, Elinor Carmi, Simeon Yates, and Kay O’Halloran. 2022. Developing fake news immunity: fallacies as misinformation triggers during the pandemic. Online Journal of Communication and Media Technologies, 12(3). - Musi and Reed (2022) Elena Musi and Chris Reed. 2022. From fallacies to semi-fake news: Improving the identification of misinformation triggers across digital media. Discourse & Society, 33(3):349–370. - Nakpih and Santini (2020) Callistus Ireneous Nakpih and Simone Santini. 2020. Automated discovery of logical fallacies in legal argumentation. International Journal of Artificial Intelligence and Applications (IJAIA), 11. - Olausson et al. (2023) Theo Olausson, Alex Gu, Ben Lipkin, Cedegao Zhang, Armando Solar-Lezama, Joshua Tenenbaum, and Roger Levy. 2023. LINC: A neurosymbolic approach for logical reasoning by combining language models with first-order logic provers. In Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing, pages 5153–5176, Singapore. Association for Computational Linguistics. - Oshikawa et al. (2020) Ray Oshikawa, Jing Qian, and William Yang Wang. 2020. A survey on natural language processing for fake news detection. In Proceedings of the Twelfth Language Resources and Evaluation Conference, pages 6086–6093, Marseille, France. European Language Resources Association. - Pan et al. (2023) Liangming Pan, Alon Albalak, Xinyi Wang, and William Wang. 2023. Logic-LM: Empowering large language models with symbolic solvers for faithful logical reasoning. In Findings of the Association for Computational Linguistics: EMNLP 2023, pages 3806–3824, Singapore. Association for Computational Linguistics. - Parmar et al. (2024) Mihir Parmar, Nisarg Patel, Neeraj Varshney, Mutsumi Nakamura, Man Luo, Santosh Mashetty, Arindam Mitra, and Chitta Baral. 2024. LogicBench: Towards systematic evaluation of logical reasoning ability of large language models. In Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 13679–13707, Bangkok, Thailand. Association for Computational Linguistics. - Pauli et al. (2022) Amalie Pauli, Leon Derczynski, and Ira Assent. 2022. Modelling persuasion through misuse of rhetorical appeals. In Proceedings of the Second Workshop on NLP for Positive Impact (NLP4PI), pages 89–100, Abu Dhabi, United Arab Emirates (Hybrid). Association for Computational Linguistics. - Pi et al. (2022) Xinyu Pi, Wanjun Zhong, Yan Gao, Nan Duan, and Jian-Guang Lou. 2022. Logigan: Learning logical reasoning via adversarial pre-training. Preprint, arXiv:2205.08794. - Prasad et al. (2008) Rashmi Prasad, Nikhil Dinesh, Alan Lee, Eleni Miltsakaki, Livio Robaldo, Aravind Joshi, and Bonnie Webber. 2008. The Penn Discourse TreeBank 2.0. In Proceedings of the Sixth International Conference on Language Resources and Evaluation (LREC’08), Marrakech, Morocco. European Language Resources Association (ELRA). - Qi et al. (2020) Peng Qi, Yuhao Zhang, Yuhui Zhang, Jason Bolton, and Christopher D. Manning. 2020. Stanza: A Python natural language processing toolkit for many human languages. In Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics: System Demonstrations. - Rashkin et al. (2017) Hannah Rashkin, Eunsol Choi, Jin Yea Jang, Svitlana Volkova, and Yejin Choi. 2017. Truth of varying shades: Analyzing language in fake news and political fact-checking. In Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing, pages 2931–2937, Copenhagen, Denmark. Association for Computational Linguistics. - Risen et al. (2007) Jane Risen, Thomas Gilovich, R Sternberg, D Halpern, and H Roediger. 2007. Informal logical fallacies. Critical thinking in psychology, 110. - Sahai et al. (2021) Saumya Sahai, Oana Balalau, and Roxana Horincar. 2021. Breaking down the invisible wall of informal fallacies in online discussions. In Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), pages 644–657, Online. Association for Computational Linguistics. - Sanyal et al. (2023) Soumya Sanyal, Yichong Xu, Shuohang Wang, Ziyi Yang, Reid Pryzant, Wenhao Yu, Chenguang Zhu, and Xiang Ren. 2023. APOLLO: A simple approach for adaptive pretraining of language models for logical reasoning. In Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 6308–6321, Toronto, Canada. Association for Computational Linguistics. - Sheng et al. (2021) Emily Sheng, Kai-Wei Chang, Prem Natarajan, and Nanyun Peng. 2021. “nice try, kiddo”: Investigating ad hominems in dialogue responses. In Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pages 750–767, Online. Association for Computational Linguistics. - Sourati et al. (2023a) Zhivar Sourati, Filip Ilievski, Hông-Ân Sandlin, and Alain Mermoud. 2023a. Case-based reasoning with language models for classification of logical fallacies. arXiv preprint arXiv:2301.11879. - Sourati et al. (2023b) Zhivar Sourati, Vishnu Priya Prasanna Venkatesh, Darshan Deshpande, Himanshu Rawlani, Filip Ilievski, Hông-Ân Sandlin, and Alain Mermoud. 2023b. Robust and explainable identification of logical fallacies in natural language arguments. Knowledge-Based Systems, 266:110418. - Stab and Gurevych (2017) Christian Stab and Iryna Gurevych. 2017. Recognizing insufficiently supported arguments in argumentative essays. In Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 1, Long Papers, pages 980–990, Valencia, Spain. Association for Computational Linguistics. - Tindale (2007) Christopher W Tindale. 2007. Fallacies and argument appraisal. Cambridge University Press. - Touvron et al. (2023) Hugo Touvron, Louis Martin, Kevin Stone, Peter Albert, Amjad Almahairi, Yasmine Babaei, Nikolay Bashlykov, Soumya Batra, Prajjwal Bhargava, Shruti Bhosale, Dan Bikel, Lukas Blecher, Cristian Canton Ferrer, Moya Chen, Guillem Cucurull, David Esiobu, Jude Fernandes, Jeremy Fu, Wenyin Fu, Brian Fuller, Cynthia Gao, Vedanuj Goswami, Naman Goyal, Anthony Hartshorn, Saghar Hosseini, Rui Hou, Hakan Inan, Marcin Kardas, Viktor Kerkez, Madian Khabsa, Isabel Kloumann, Artem Korenev, Punit Singh Koura, Marie-Anne Lachaux, Thibaut Lavril, Jenya Lee, Diana Liskovich, Yinghai Lu, Yuning Mao, Xavier Martinet, Todor Mihaylov, Pushkar Mishra, Igor Molybog, Yixin Nie, Andrew Poulton, Jeremy Reizenstein, Rashi Rungta, Kalyan Saladi, Alan Schelten, Ruan Silva, Eric Michael Smith, Ranjan Subramanian, Xiaoqing Ellen Tan, Binh Tang, Ross Taylor, Adina Williams, Jian Xiang Kuan, Puxin Xu, Zheng Yan, Iliyan Zarov, Yuchen Zhang, Angela Fan, Melanie Kambadur, Sharan Narang, Aurelien Rodriguez, Robert Stojnic, Sergey Edunov, and Thomas Scialom. 2023. Llama 2: Open foundation and fine-tuned chat models. Preprint, arXiv:2307.09288. - Walton (2010) Douglas Walton. 2010. Why fallacies appear to be better arguments than they are. Informal logic, 30(2):159–184. - Walton et al. (2008) Douglas Walton, Christopher Reed, and Fabrizio Macagno. 2008. Argumentation schemes. Cambridge University Press. - Walton (1987) Douglas N Walton. 1987. What is a fallacy. Eemeren, Frans H. van/Grootendorst, Rob/Blair, J. Anthony/Willard, Charles A.(eds.): Argumentation: Across the Lines of Discipline. Dordrecht/Providence, Foris Publications, pages 323–330. - Wei et al. (2023) Jason Wei, Xuezhi Wang, Dale Schuurmans, Maarten Bosma, Brian Ichter, Fei Xia, Ed Chi, Quoc Le, and Denny Zhou. 2023. Chain-of-thought prompting elicits reasoning in large language models. Preprint, arXiv:2201.11903. - Xu et al. (2023) Fangzhi Xu, Qika Lin, Jiawei Han, Tianzhe Zhao, Jun Liu, and Erik Cambria. 2023. Are large language models really good logical reasoners? a comprehensive evaluation and beyond. Preprint, arXiv:2306.09841. - Yang et al. (2017) Fan Yang, Arjun Mukherjee, and Eduard Dragut. 2017. Satirical news detection and analysis using attention mechanism and linguistic features. In Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing, pages 1979–1989, Copenhagen, Denmark. Association for Computational Linguistics. - Zhang et al. (2023) Hanlin Zhang, Jiani Huang, Ziyang Li, Mayur Naik, and Eric Xing. 2023. Improved logical reasoning of language models via differentiable symbolic programming. In Findings of the Association for Computational Linguistics: ACL 2023, pages 3062–3077, Toronto, Canada. Association for Computational Linguistics. - Zhao et al. (2023) Hongyu Zhao, Kangrui Wang, Mo Yu, and Hongyuan Mei. 2023. Explicit planning helps language models in logical reasoning. In Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing, pages 11155–11173, Singapore. Association for Computational Linguistics. - Zhou et al. (2023) Denny Zhou, Nathanael Schärli, Le Hou, Jason Wei, Nathan Scales, Xuezhi Wang, Dale Schuurmans, Claire Cui, Olivier Bousquet, Quoc Le, and Ed Chi. 2023. Least-to-most prompting enables complex reasoning in large language models. Preprint, arXiv:2205.10625. ## Appendix A Statistical Analysis of Logical Relations Table 9 presents the ratio of samples that contain the ten logical relations in fallacy and no fallacy classes, where we take the Argotario Habernal et al. (2017) and Reddit Sahai et al. (2021) datasets as examples. Further, Table 10 shows the ratio of samples that contain the ten logical relations in each fallacy type, where we take the Logic dataset Jin et al. (2022) as an example. ## Appendix B Instruction Prompt for Fallacy Detection and Classification ### B.1 Prompt for Fallacy Detection The instruction prompt for the Llama-2 or Flan-T5 baseline model is: "The task is to detect whether the Text contains logical fallacy or not. The logical fallacy can be <fallacy name (fallacy definition)>. Please answer Yes if the Text contains logical fallacy, else answer No. Text: <text>. Answer:" The instruction prompt that incorporates the textualized tree into the Llama-2 or Flan-T5 model is: "The task is to detect whether the Text contains logical fallacy or not. The logical fallacy can be <fallacy name (fallacy definition)>. The logical relations in the Text are presented in this table: argument 1, logical relation, argument 2 <textualized tree>. Please answer Yes if the Text contains logical fallacy, else answer No. Text: <text>. Answer:" ### B.2 Prompt for Fallacy Classification The instruction prompt for the Llama-2 or Flan-T5 baseline model is: "The task is to classify the fallacy type of the Text. Choose one answer from these fallacy types: <fallacy names list>. The definitions of each fallacy type are as follows. <fallacy name: fallacy definition>. Please classify the fallacy type of the Text. Text: <text>. Answer:" The instruction prompt that incorporates the textualized tree into the Llama-2 or Flan-T5 model is: "The task is to classify the fallacy type of the Text. Choose one answer from these fallacy types: <fallacy names list>. The definitions of each fallacy type are as follows. <fallacy name: fallacy definition>. The logical relations in the Text are presented in this table: argument 1, logical relation, argument 2 <textualized tree>. Please classify the fallacy type of the Text. Text: <text>. Answer:" ## Appendix C Prompt for GPT-based baselines ### C.1 Prompt for Fallacy Detection The instruction prompt for the gpt-3.5-turbo baseline is: "The task is to detect whether the Text contains logical fallacy or not. The logical fallacy can be <fallacy name (fallacy definition)>. Please answer Yes if the Text contains logical fallacy, else answer No. Text: <text>. Answer:" The instruction prompt that incorporates the logical structure into gpt-3.5-turbo model through a chain-of-thought process is: "The task is to detect whether the Text contains logical fallacy or not. The logical fallacy can be <fallacy name (fallacy definition)>. Please answer Yes if the Text contains logical fallacy, else answer No. Let’s think step by step. Firstly, explain the logical relations and logical structure in the text. Secondly, choose the answer. Please mimic the output style in the Example. Example: <example text>. Output: Firstly, explain the logical relations and logical structure in the text. <explanation of logical relations in the example>. Secondly, choose the answer. Answer: <fallacy label of the example>. Text: <text>. Output:" ### C.2 Prompt for Fallacy Classification The instruction prompt for the gpt-3.5-turbo baseline is: "The task is to classify the fallacy type of the Text. Choose one answer from these fallacy types: <fallacy names list>. The definitions of each fallacy type are as follows. <fallacy name: fallacy definition>. Please classify the fallacy type of the Text. Text: <text>. Answer:" The instruction prompt that incorporates the logical structure into gpt-3.5-turbo model through a chain-of-thought process is: "The task is to classify the fallacy type of the Text. Choose one answer from these fallacy types: <fallacy names list>. The definitions of each fallacy type are as follows. <fallacy name: fallacy definition>. Please classify the fallacy type of the Text. Let’s think step by step. Firstly, explain the logical relations and logical structure in the text. Secondly, choose the answer. Please mimic the output style in the Example. Example: <example text>. Output: Firstly, explain the logical relations and logical structure in the text. <explanation of logical relations in the example>. Secondly, choose the answer. Answer: <fallacy label of the example>. Text: <text>. Output:" ## Appendix D The Names and Definitions of Fallacies ### D.1 Argotario dataset The Argotario dataset Habernal et al. (2017) includes five fallacy types: Ad Hominem, Appeal to Emotion, Hasty Generalization, Irrelevant Authority, Red Herring. The name of Appeal to Emotion is converted into Emotional Language. The definitions of these fallacy types which are used in the instruction prompt are: - Ad Hominem: the text attack a person instead of arguing against the claims. - Emotional Language: the text arouse non-rational emotions. - Hasty Generalization: the text draw a broad conclusion based on a limited sample of population. - Irrelevant Authority: the text cite an authority but the authority lacks relevant expertise. - Red Herring: the text diverge the attention to irrelevant issues. ### D.2 Reddit dataset The Reddit dataset Sahai et al. (2021) includes eight fallacy types and their label names are: Slippery Slope, Irrelevant Authority, Hasty Generalization, Black-and-White Fallacy, Ad Populum, Tradition Fallacy, Naturalistic Fallacy, Worse Problem Fallacy. The definitions of these fallacy types which are used in the instruction prompt are: - Slippery Slope: the text suggest taking a small initial step leads to a chain of related events culminating in significant effect. - Irrelevant Authority: the text cite an authority but the authority lacks relevant expertise. - Hasty Generalization: the text draw a broad conclusion based on a limited sample of population. - Black-and-White Fallacy: the text present two alternative options as the only possibilities. - Ad Populum: the text affirm something is true because the majority thinks so. - Tradition Fallacy: the text argue the action has always been done in the tradition. - Naturalistic Fallacy: the text claim something is good or bad because it is natural or unnatural. - Worse Problem Fallacy: the text justify an issue by arguing more severe issues exists. ### D.3 Climate dataset The Climate dataset Alhindi et al. (2022) includes the following fallacy types: Evading Burden of Proof, Cherry Picking, Red Herring, Strawman, False Authority, Hasty Generalization, False Cause, Post Hoc, False Analogy, Vagueness. The name of False Authority is replaced by Irrelevant Authority. The class of Post Hoc is combined into False Cause. The definitions of these fallacy types which are used in the instruction prompt are: - Evading Burden of Proof: the text make a claim without evidence or supporting argument. - Cherry Picking: the text selectively present partial evidence to support a claim. - Red Herring: the text diverge the attention to irrelevant issues. - Strawman: the text distort the claim to another one to make it easier to attack. - Irrelevant Authority: the text cite an authority but the authority lacks relevant expertise. - Hasty Generalization: the text draw a broad conclusion based on a limited sample of population. - False Cause: the text assume two correlated events must also have a causal relation. - False Analogy: the text assume two alike things must be alike in other aspects. - Vagueness: the text use ambiguous words, terms, or phrases. ### D.4 Logic dataset The Logic dataset Jin et al. (2022) annotates 13 types of fallacy: Ad Hominem, Ad Populum, False Dilemma (Black-and-White Fallacy), False Cause, Circular Reasoning, Fallacy of Logic (Deductive Fallacy), Appeal to Emotion (Emotional Language), Equivocation, Fallacy of Extension (Extension Fallacy), Faulty Generalization (Hasty Generalization), Intentional Fallacy, Fallacy of Credibility (Irrelevant Authority), Fallacy of Relevance (Red Herring). The names in the parenthesis are the replaced names used in the instruction prompt. The definitions of these fallacy types which are used in the instruction prompt are: - Ad Hominem: the text attack a person instead of arguing against the claims. - Ad Populum: the text affirm something is true because the majority thinks so. - Black-and-White Fallacy: the text present two alternative options as the only possibilities. - False Cause: the text assume two correlated events must also have a causal relation. - Circular Reasoning: the end of the text come back to the beginning without having proven itself. - Deductive Fallacy: the text has an error in the logical reasoning. - Emotional Language: the text arouse non-rational emotions. - Equivocation: the text use a key term in multiple senses, leading to ambiguous conclusions. - Extension Fallacy: the text attack an exaggerated version of the opponent’s claim. - Hasty Generalization: the text draw a broad conclusion based on a limited sample of population. - Intentional Fallacy: the text show intentional action to incorrectly support an argument. - Irrelevant Authority: the text cite an authority but the authority lacks relevant expertise. - Red Herring: the text diverge the attention to irrelevant issues. | % | conjunction | alternative | restatement | instantiation | contrast | concession | analogy | temporal | condition | causal | | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | | fallacy | 37.96 | 46.72 | 1.46 | 0.73 | 48.91 | 1.46 | 6.57 | 10.95 | 16.06 | 69.34 | | no fallacy | 28.13 | 40.63 | 3.13 | 0.00 | 42.19 | 3.13 | 1.56 | 7.81 | 15.63 | 56.25 | | fallacy | 64.04 | 75.44 | 4.39 | 2.92 | 67.54 | 8.19 | 16.67 | 26.90 | 34.80 | 79.24 | | no fallacy | 50.31 | 69.63 | 3.37 | 1.53 | 67.18 | 7.98 | 19.94 | 25.46 | 33.44 | 73.01 | Table 9: The ratio (%) of samples that contain the ten logical relations in fallacy and no fallacy classes in the development set of Argotario (the first two rows) and Reddit (the latter two rows) datasets. | % | conjunction | alternative | restatement | instantiation | contrast | concession | analogy | temporal | condition | causal | | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | | Ad Hominem | 30.22 | 60.44 | 0.44 | 0.44 | 64.44 | 2.22 | 7.55 | 12.00 | 12.44 | 76.89 | | Ad Populum | 20.88 | 47.46 | 0.63 | 1.89 | 27.21 | 1.89 | 5.06 | 10.76 | 10.12 | 72.15 | | False Dilemma | 18.34 | 79.81 | 0.91 | 0.00 | 36.69 | 2.75 | 1.83 | 15.59 | 28.44 | 50.45 | | False Cause | 46.74 | 62.72 | 00.00 | 00.00 | 36.68 | 1.18 | 3.55 | 37.87 | 11.24 | 86.98 | | Circular Claim | 24.24 | 38.63 | 00.00 | 0.75 | 37.87 | 00.00 | 3.03 | 11.36 | 9.09 | 83.33 | | Deductive | 28.09 | 63.63 | 00.00 | 00.00 | 39.67 | 0.82 | 19.83 | 17.35 | 24.79 | 76.03 | | Emotional | 41.86 | 59.68 | 2.32 | 0.00 | 50.38 | 1.55 | 7.75 | 18.60 | 28.68 | 63.56 | | Equivocation | 42.10 | 71.05 | 00.00 | 00.00 | 63.16 | 7.89 | 5.26 | 31.57 | 28.94 | 76.31 | | Extension | 54.71 | 73.58 | 00.00 | 1.88 | 62.26 | 0.94 | 11.32 | 11.32 | 18.86 | 87.73 | | Generalization | 38.99 | 52.83 | 0.94 | 0.63 | 39.93 | 1.88 | 8.49 | 23.27 | 31.13 | 69.49 | | Intentional | 29.46 | 48.21 | 2.67 | 0.89 | 60.71 | 4.46 | 5.36 | 18.75 | 25.00 | 67.85 | | Authority | 39.25 | 66.35 | 2.80 | 4.67 | 41.12 | 2.80 | 3.73 | 7.47 | 16.82 | 84.11 | | Relevance | 35.96 | 67.54 | 0.87 | 0.00 | 55.26 | 00.00 | 4.38 | 20.17 | 12.28 | 74.56 | | Overall | 34.49 | 58.97 | 0.87 | 0.82 | 45.97 | 1.85 | 6.91 | 18.22 | 19.75 | 74.37 | Table 10: The ratio (%) of samples that contain the ten logical relations in each fallacy type in the Logic dataset. The fallacy types include Ad Hominem, Ad Populum, False Dilemma (Black-and-White Fallacy), False Cause, Circular Reasoning, Deductive Fallacy, Appeal to Emotion (Emotional Language), Equivocation, Fallacy of Extension, Faulty Generalization (Hasty Generalization), Intentional Fallacy, Fallacy of Credibility (Irrelevant Authority), Fallacy of Relevance (Red Herring).