WeSearch

Breaking the Chains of Probability: Neutrosophic Logic as a New Framework for Epistemic Uncertainty in Large Language Models

·3 min read · 0 reactions · 0 comments · 42 views
Breaking the Chains of Probability: Neutrosophic Logic as a New Framework for Epistemic Uncertainty in Large Language Models
TL;DR · WeSearch summary

A new framework utilizing Neutrosophic Logic has been proposed to address epistemic uncertainty in Large Language Models (LLMs). This approach allows for a more nuanced representation of uncertainty by treating truth, indeterminacy, and falsity as independent dimensions. The findings suggest that integrating neutrosophic evaluation layers can enhance the transparency and ethical considerations of AI systems.

Key facts
About this source

arXiv cs.AI files mainly under ai research. We currently carry 1,128 of its stories.

Original article
arXiv cs.AI
Read full at arXiv cs.AI →

Story provenance

Source · retrieval · rights · ranking — open for full record
inspect →

Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.

Record

Original publisherarXiv cs.AI
Canonical URLhttps://arxiv.org/abs/2605.24053
Publication timeTue, 26 May 2026 00:00:00 -0400
Retrieval time2026-05-26T04:07:43.013Z
Last seen2026-05-26T04:07:43.013Z
Headline sourcePublisher (no WeSearch rewrite)
Excerpt sourcepublisher body
Excerpt methodFirst ~120 words (~800 chars) of extracted publisher body, fair-use limited.
SummaryWeSearch · cerebras-chat (WeSearch summarizer)
Summary source textcontentText
Citation coverageSummary is a WeSearch-generated derivative; primary citation is the original publisher URL.
ClusterWBPxCET45PdJ
Cluster logicGrouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison.
Ranking reasonStory pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking.
Publisher visitYes — open original
Substitutes article?No — link-out required for full text

Rights status (four layers)

Publisher-declared
No publisher-confirmed rights record for this source yet.
Machine-readable
No source-specific machine-readable restriction detected beyond the public feed.
WeSearch interpretation
WeSearch declared handling (basis: Derived from the published RSS/Atom feed). This is WeSearch policy, not a legal grant on the publisher's behalf.
Unknown
Retrieval and training permissions are not asserted unless the publisher confirms them.

WeSearch handling by dimension

Indexing May the item be indexed (stored, ranked, made findable)? Allowed
Snippet May a short excerpt of the publisher's text be shown? Allowed
AI summary May WeSearch generate its own short summary of the article? Limited
Retrieval / RAG May the content be exposed for third-party retrieval-augmented generation? Not asserted
Model training May the content be used to train AI models? Not asserted
Commercial reuse May the content be reused commercially? Not permitted

Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.

Opening excerpt (first ~120 words) tap to expand

Computer Science > Artificial Intelligence arXiv:2605.24053 (cs) [Submitted on 22 May 2026] Title:Breaking the Chains of Probability: Neutrosophic Logic as a New Framework for Epistemic Uncertainty in Large Language Models Authors:Maikel Yelandi Leyva-Vázquez, Florentin Smarandache View a PDF of the paper titled Breaking the Chains of Probability: Neutrosophic Logic as a New Framework for Epistemic Uncertainty in Large Language Models, by Maikel Yelandi Leyva-V\'azquez and Florentin Smarandache View PDF HTML (experimental) Abstract:Large Language Models (LLMs) are predominantly governed by probabilistic frameworks in which the sum of outcome probabilities is constrained to unity.

Excerpt limited to ~120 words for fair-use compliance. The full article is at arXiv cs.AI.

Anonymous · no account needed
Share 𝕏 Facebook Reddit LinkedIn Threads WhatsApp Bluesky Mastodon Email

Discussion

0 comments

More from arXiv cs.AI