View in EDS

A logic with probabilistic Jaccard similarity.

Saved in:

Bibliographic Details
Title:	A logic with probabilistic Jaccard similarity.
Authors:	Dabić, Maja¹ (AUTHOR), Stojanović, Nenad¹ (AUTHOR), Ikodinović, NebojŠa² (AUTHOR)
Source:	Journal of Logic & Computation. Mar2026, Vol. 36 Issue 2, p1-24. 24p.
Subjects:	Propositional calculus, Decidability (Mathematical logic), Artificial intelligence, Axioms
Abstract:	We introduce an extension of classical probabilistic propositional logic \|$\mathsf{LPP}_{1}$\|⁠ , understood as an extension of classical propositional calculus with real-valued probability functions and iterated probability operators, by incorporating similarity operators based on the Jaccard index. The binary operators \|$J_{\geqslant s}(\alpha ,\beta)$\| and \|$J_{\leqslant s}(\alpha ,\beta)$\| allow us to formally reason about the degree of similarity between propositions, defined through the ratio of the probability of their conjunction and the probability of their disjunction. This addition enriches the expressive power of probabilistic logic and provides a natural way to capture relationships between formulas that go beyond absolute probability. We present the syntax and semantics of the resulting system \|$\mathsf{LP}_{J}$\|⁠ , establish a sound and complete axiomatization, and prove decidability by reducing satisfiability problems to finite systems of linear inequalities over real closed fields. The logic thus provides a mathematically robust framework that combines probability and similarity, with potential applications in artificial intelligence, knowledge representation and decision-making, especially in contexts where clustering and comparison of structured knowledge are essential. [ABSTRACT FROM AUTHOR]
	Copyright of Journal of Logic & Computation is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	We introduce an extension of classical probabilistic propositional logic \|$\mathsf{LPP}_{1}$\|⁠ , understood as an extension of classical propositional calculus with real-valued probability functions and iterated probability operators, by incorporating similarity operators based on the Jaccard index. The binary operators \|$J_{\geqslant s}(\alpha ,\beta)$\| and \|$J_{\leqslant s}(\alpha ,\beta)$\| allow us to formally reason about the degree of similarity between propositions, defined through the ratio of the probability of their conjunction and the probability of their disjunction. This addition enriches the expressive power of probabilistic logic and provides a natural way to capture relationships between formulas that go beyond absolute probability. We present the syntax and semantics of the resulting system \|$\mathsf{LP}_{J}$\|⁠ , establish a sound and complete axiomatization, and prove decidability by reducing satisfiability problems to finite systems of linear inequalities over real closed fields. The logic thus provides a mathematically robust framework that combines probability and similarity, with potential applications in artificial intelligence, knowledge representation and decision-making, especially in contexts where clustering and comparison of structured knowledge are essential. [ABSTRACT FROM AUTHOR]
ISSN:	0955792X
DOI:	10.1093/logcom/exag004