Plausible Reasoning and First-Order Plausible Logic

2026-04-21 · Source: Takara TLDR - Daily AI Papers · Field: Technology & Digital — Artificial Intelligence & Machine Learning, AI Reasoning & Formal Methods · Depth: Expert, medium

Summary

David Billington introduces Plausible Logic (PL), a novel first-order logic designed for plausible reasoning without numerical probabilities. Plausible reasoning draws conclusions from statements that are either facts or defeasible, meaning they are usually true but can be false. The article outlines 17 principles for such logics, comprising 14 necessary and 3 desirable principles. PL satisfies all but two of the desirable principles and correctly handles several important plausible reasoning examples. This logic is presented as unique in its capabilities and includes 8 distinct reasoning algorithms to account for varying sensible conclusions from a given plausible reasoning situation. The article is a condensed version of the forthcoming book "Plausible Reasoning and Plausible Logic" (PRPL), with proofs omitted.

Key takeaway

For research scientists developing AI systems that require nuanced reasoning beyond strict probabilistic models, you should investigate Plausible Logic (PL). Its unique ability to handle defeasible statements without numerical probabilities offers a distinct approach to building more human-like inference capabilities, particularly where explicit probabilities are unavailable or undesirable. Consider how PL's 8 reasoning algorithms could provide diverse, context-sensitive conclusions in your applications.

Key insights

Plausible Logic (PL) offers a unique, non-numerical first-order logic for reasoning with defeasible statements.

Principles

• Defeasible statements are usually true but can be false.
• Plausible reasoning operates without numerical probabilities.

Method

Plausible Logic (PL) defines a first-order logic satisfying 15 of 17 proposed principles for plausible reasoning, employing 8 distinct algorithms for varied conclusions.

In practice

• Apply PL for non-numerical reasoning.
• Consider PL for systems needing defeasible logic.

Topics

• Plausible Reasoning
• First-Order Logic
• Defeasible Statements
• Plausible Logic
• Reasoning Principles

Code references

• kkkkarry/LogicGraph

Best for: Research Scientist, AI Scientist, Machine Learning Engineer, NLP Engineer

Related on AIssential

• Plausible Reasoning and First-Order Plausible Logic — Plausible Logic offers a non-numeric, first-order framework for reasoning with defeasible statements and managing ambiguity.
• DeFAb: A Verifiable Benchmark for Defeasible Abduction in Foundation Models — Foundation models significantly underperform symbolic logic solvers on verifiable defeasible abduction tasks, highlighting a reasoning gap.
• Towards Non-Monotonic Entailment in Propositional Defeasible Standpoint Logic — Extending non-monotonic rational entailment to PDSL via situated conditionals allows faithful translation and preserves complexity bounds for inference.
• How to build custom reasoning agents with a fraction of the compute — RLSD combines sparse, reliable reinforcement learning with dense self-distillation for efficient, accurate AI reasoning model training.
• Graham Priest on Dialetheism, True Contradictions, the Liar Paradox & Why Classical Logic Isn’t Enough — Some contradictions are true, challenging classical logic's foundational principle of non-contradiction.
• She Raised $64M to Build an AI Math Prodigy | Carina Hong, CEO of Axiom — Axim combines formal languages and AI to create a self-improving reasoning engine for mathematical verification.

Open in AIssential →

Editorial summary, takeaway, and curation by AIssential. Original article published by Takara TLDR - Daily AI Papers.