Plausible Reasoning and First-Order Plausible Logic

• URL: http://arxiv.org/abs/2604.19036v1
• Date: Tue, 21 Apr 2026 03:39:56 GMT
• Title: Plausible Reasoning and First-Order Plausible Logic
• Abstract summary: Plausible reasoning makes conclusions from statements that are either facts or defeasible statements without using numbers.<n>There are 14 necessary principles and 3 desirable principles, one of which is not formally stated.<n>A first-order logic, called Plausible Logic (PL), is defined that satisfies all but two of the desirable principles and reasons correctly.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Defeasible statements are statements that are likely, or probable, or usually true, but may occasionally be false. Plausible reasoning makes conclusions from statements that are either facts or defeasible statements without using numbers. So there are no probabilities or suchlike involved. Seventeen principles of logics that do plausible reasoning are suggested and several important plausible reasoning examples are considered. There are 14 necessary principles and 3 desirable principles, one of which is not formally stated. A first-order logic, called Plausible Logic (PL), is defined that satisfies all but two of the desirable principles and reasons correctly with all the examples. As far as we are aware, this is the only such logic. PL has 8 reasoning algorithms because, from a given plausible reasoning situation, there are different sensible conclusions. This article is a condensation of my book `Plausible Reasoning and Plausible Logic' (PRPL), which is to be submitted. Each section of this article corresponds to a chapter in PRPL, and vice versa. The proofs of all the results are in PRPL, so they are omitted in this article.

Related papers

• Semiotic logical hexagon theory for LLM logical reasoning [15.42414269675365]
  We investigate how semantic organization influences logical reasoning in large language models (LLMs)<n>We propose HexLogicAgent, a framework that first organizes the meaning of natural-language statements and then guides logical reasoning through structured verification.<n> Experiments on challenging logical reasoning benchmarks demonstrate that HexLogicAgent consistently improves reasoning reliability across multiple LLMs.
  arXiv  Detail & Related papers  (2026-07-24T03:10:34Z)
• A Reduction of Input/Output Logics to SAT [51.82266520875928]
  Deontic logics are formalisms for reasoning over norms, obligations, permissions and prohibitions.<n>In this paper, an automation approach for I/O logics is presented that makes use of suitable reductions to propositional satisfiability problems.
  arXiv  Detail & Related papers  (2025-08-22T09:22:26Z)
• Reasoning is about giving reasons [55.56111618153049]
  We show that we can identify and extract the logical structure of natural language arguments in three popular reasoning datasets with high accuracies.<n>Our approach supports all forms of reasoning that depend on the logical structure of the natural language argument.
  arXiv  Detail & Related papers  (2025-08-20T07:26:53Z)
• Aristotle: Mastering Logical Reasoning with A Logic-Complete Decompose-Search-Resolve Framework [117.6508659085231]
  We propose a logic-complete reasoning framework, Aristotle, with three key components: Logical Decomposer, Logical Search Router, and Logical Resolver.<n>In our framework, symbolic expressions and logical rules are comprehensively integrated into the entire reasoning process.<n>The experimental results on several datasets demonstrate that Aristotle consistently outperforms state-of-the-art reasoning frameworks in both accuracy and efficiency.
  arXiv  Detail & Related papers  (2024-12-22T10:14:09Z)
• A logic for reasoning with inconsistent knowledge -- A reformulation using nowadays terminology (2024) [0.0]
  This paper describes a logic for reasoning with inconsistent knowledge.<n>A reliability relation is used to choose between incompatible assumptions.<n>As long as no contradiction is derived, the knowledge is assumed to be consistent.
  arXiv  Detail & Related papers  (2024-11-15T13:53:05Z)
• MetaLogic: Logical Reasoning Explanations with Fine-Grained Structure [129.8481568648651]
  We propose a benchmark to investigate models' logical reasoning capabilities in complex real-life scenarios. Based on the multi-hop chain of reasoning, the explanation form includes three main components. We evaluate the current best models' performance on this new explanation form.
  arXiv  Detail & Related papers  (2022-10-22T16:01:13Z)
• Certain and Uncertain Inference with Indicative Conditionals [0.3437656066916039]
  We develop a trivalent semantics for the truth conditions and the probability of the natural language conditional. We show systematic correspondences between trivalent and probabilistic representations of inferences in either framework. The result is a unified account of the semantics and indicative of conditionals that can be fruitfully applied to analyzing the validity of conditional inferences.
  arXiv  Detail & Related papers  (2022-07-17T20:06:00Z)
• Abstract argumentation and answer set programming: two faces of Nelson's logic [7.513733974830771]
  We show that both logic programming and abstract argumentation frameworks can be interpreted in terms of Nelson's constructive logic N4. We do so by formalizing, in this logic, two principles that we call non-contradictory inference and strengthened closed world assumption.
  arXiv  Detail & Related papers  (2022-03-27T22:18:44Z)
• Logical Credal Networks [87.25387518070411]
  This paper introduces Logical Credal Networks, an expressive probabilistic logic that generalizes many prior models that combine logic and probability. We investigate its performance on maximum a posteriori inference tasks, including solving Mastermind games with uncertainty and detecting credit card fraud.
  arXiv  Detail & Related papers  (2021-09-25T00:00:47Z)
• Uncertain Linear Logic via Fibring of Probabilistic and Fuzzy Logic [0.0]
  probabilistic and fuzzy logic correspond to two different assumptions regarding the combination of propositions whose evidence bases are not currently available. It is shown that these two sets of formulas provide a natural grounding for the multiplicative and additive operator-sets in linear logic. The concept of linear logic as a logic of resources" is manifested here via the principle of conservation of evidence"
  arXiv  Detail & Related papers  (2020-09-28T00:19:42Z)
• Foundations of Reasoning with Uncertainty via Real-valued Logics [70.43924776071616]
  We give a sound and strongly complete axiomatization that can be parametrized to cover essentially every real-valued logic. Our class of sentences are very rich, and each describes a set of possible real values for a collection of formulas of the real-valued logic.
  arXiv  Detail & Related papers  (2020-08-06T02:13:11Z)

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.