A Note on Argumentative Topology: Circularity and Syllogisms as Unsolved Problems

• URL: http://arxiv.org/abs/2102.03874v1
• Date: Sun, 7 Feb 2021 18:30:37 GMT
• Title: A Note on Argumentative Topology: Circularity and Syllogisms as Unsolved Problems
• Authors: Wlodek W. Zadrozny
• Abstract summary: We show that the problem of connecting logic, topology and text is still very much unsolved. We conclude that there is no clear answer to the question: Can we find a circle in a circular argument?''
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In the last couple of years there were a few attempts to apply topological data analysis to text, and in particular to natural language inference. A recent work by Tymochko et al. suggests the possibility of capturing `the notion of logical shape in text,' using `topological delay embeddings,' a technique derived from dynamical systems, applied to word embeddings. In this note we reconstruct their argument and show, using several old and new examples, that the problem of connecting logic, topology and text is still very much unsolved. We conclude that there is no clear answer to the question: ``Can we find a circle in a circular argument?'' We point out some possible avenues of exploration. The code used in our experiment is also shown.

Related papers

• Fuse, Reason and Verify: Geometry Problem Solving with Parsed Clauses from Diagram [78.79651421493058]
  We propose a neural-symbolic model for plane geometry problem solving (PGPS) with three key steps: modal fusion, reasoning process and knowledge verification. For reasoning, we design an explicable solution program to describe the geometric reasoning process, and employ a self-limited decoder to generate solution program autoregressively. We also construct a large-scale geometry problem dataset called PGPS9K, containing fine-grained annotations of textual clauses, solution program and involved knowledge solvers.
  arXiv  Detail & Related papers  (2024-07-10T02:45:22Z)
• NELLIE: A Neuro-Symbolic Inference Engine for Grounded, Compositional, and Explainable Reasoning [59.16962123636579]
  This paper proposes a new take on Prolog-based inference engines. We replace handcrafted rules with a combination of neural language modeling, guided generation, and semi dense retrieval. Our implementation, NELLIE, is the first system to demonstrate fully interpretable, end-to-end grounded QA.
  arXiv  Detail & Related papers  (2022-09-16T00:54:44Z)
• Logical Fallacy Detection [40.06349885733248]
  We propose the task of logical fallacy detection, and provide a new dataset (Logic) of logical fallacies generally found in text. We show that a simple structure-aware classifier outperforms the best language model by 5.46% on Logic and 4.51% on LogicClimate.
  arXiv  Detail & Related papers  (2022-02-28T13:18:26Z)
• Answering Fuzzy Queries over Fuzzy DL-Lite Ontologies [0.2741266294612776]
  We study the problem of answering conjunctive queries and threshold queries in fuzzy DL-Lite. For the idemdent G"odel t-norm, we provide an effective method based on a reduction to the classical case.
  arXiv  Detail & Related papers  (2021-11-23T10:45:54Z)
• Abstract Reasoning via Logic-guided Generation [65.92805601327649]
  Abstract reasoning, i.e., inferring complicated patterns from given observations, is a central building block of artificial general intelligence. This paper aims to design a framework for the latter approach and bridge the gap between artificial and human intelligence. We propose logic-guided generation (LoGe), a novel generative DNN framework that reduces abstract reasoning as an optimization problem in propositional logic.
  arXiv  Detail & Related papers  (2021-07-22T07:28:24Z)
• Inter-GPS: Interpretable Geometry Problem Solving with Formal Language and Symbolic Reasoning [123.06420835072225]
  We construct a new large-scale benchmark, Geometry3K, consisting of 3,002 geometry problems with dense annotation in formal language. We propose a novel geometry solving approach with formal language and symbolic reasoning, called Interpretable Geometry Problem solver (Inter-GPS) Inter-GPS incorporates theorem knowledge as conditional rules and performs symbolic reasoning step by step.
  arXiv  Detail & Related papers  (2021-05-10T07:46:55Z)
• A Theoretical Analysis of the Repetition Problem in Text Generation [55.8184629429347]
  We show that the repetition problem is, unfortunately, caused by the traits of our language itself. One major reason is attributed to the fact that there exist too many words predicting the same word as the subsequent word with high probability. We propose a novel rebalanced encoding approach to alleviate the high inflow problem.
  arXiv  Detail & Related papers  (2020-12-29T08:51:47Z)
• Argumentative Topology: Finding Loop(holes) in Logic [3.977669302067367]
  Topological Word Embeddings uses mathematical techniques in dynamical system analysis and data driven shape extraction. We show that using a topological delay embedding we are able to capture and extract a different, shape-based notion of logic.
  arXiv  Detail & Related papers  (2020-11-17T21:23:58Z)
• Higher-order Logic as Lingua Franca -- Integrating Argumentative Discourse and Deep Logical Analysis [0.0]
  We present an approach towards the deep, pluralistic logical analysis of argumentative discourse. We use state-of-the-art automated reasoning technology for classical higher-order logic.
  arXiv  Detail & Related papers  (2020-07-02T11:07:53Z)
• Multi-Step Inference for Reasoning Over Paragraphs [95.91527524872832]
  Complex reasoning over text requires understanding and chaining together free-form predicates and logical connectives. We present a compositional model reminiscent of neural module networks that can perform chained logical reasoning.
  arXiv  Detail & Related papers  (2020-04-06T21:12:53Z)
• A Novel Method of Extracting Topological Features from Word Embeddings [2.4063592468412267]
  We introduce a novel algorithm to extract topological features from word embedding representation of text. We will show our defined topological features may outperform conventional text mining features.
  arXiv  Detail & Related papers  (2020-03-29T16:55:23Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.