On Selecting a Conjunction Operation in Probabilistic Soft Logic
Vladik Kreinovich, Chitta Baral

TL;DR
This paper explains the reasoning behind the choice of conjunction operations in Probabilistic Soft Logic, proposing a more general family of operations to enhance its application in handling uncertainty and relational data.
Contribution
It provides a theoretical justification for the conjunction operation choice in Probabilistic Soft Logic and introduces a broader family of such operations for future use.
Findings
Theoretical explanation for conjunction choice
Introduction of a generalized family of conjunction operations
Potential for improved application in uncertain and relational reasoning
Abstract
Probabilistic Soft Logic has been proposed and used in several applications as an efficient way to deal with inconsistency, uncertainty and relational representation. In several applications, this approach has led to an adequate description of the corresponding human reasoning. In this paper, we provide a theoretical explanation for one of the semi-heuristic choices made in this approach: namely, we explain the choice of the corresponding conjunction operations. Our explanation leads to a more general family of operations which may be used in future applications of probabilistic soft logic.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Bayesian Modeling and Causal Inference · Rough Sets and Fuzzy Logic
