Table of Contents
Fetching ...

Support + Belief = Decision Trust

Alessandro Aldini, Agata Ciabattoni, Dominik Pichler, Mirko Tagliaferri

TL;DR

SBTrust introduces a unified logical framework for decision trust by combining a belief modality with a novel non-monotonic support operator. The support connective, interpreted via preference-based semantics, captures when one statement most likely supports another, while belief anchors subjective truth, yielding a trust operator Tφψ that requires both φ and φ supports ψ to hold. The paper provides syntax, semantics, and proof theory, and shows SBTrust is sound, complete, and PSPACE-complete for satisfiability, with tractable model checking. By connecting to KLM and Åqvist FA84 and allowing multiple support systems via trust frames, SBTrust offers a flexible, integrative approach to reasoning about trust across cognitive, policy, and reputation factors. The framework lays groundwork for future extensions such as nesting, proofs, and dynamic multi-agent settings, broadening applicability to complex, real-world trust environments.

Abstract

We present SBTrust, a logical framework designed to formalize decision trust. Our logic integrates a doxastic modality with a novel non-monotonic conditional operator that establishes a positive support relation between statements, and is closely related to a known dyadic deontic modality. For SBTrust, we provide semantics, proof theory and complexity results, as well as motivating examples. Compared to existing approaches, our framework seamlessly accommodates the integration of multiple factors in the emergence of trust.

Support + Belief = Decision Trust

TL;DR

SBTrust introduces a unified logical framework for decision trust by combining a belief modality with a novel non-monotonic support operator. The support connective, interpreted via preference-based semantics, captures when one statement most likely supports another, while belief anchors subjective truth, yielding a trust operator Tφψ that requires both φ and φ supports ψ to hold. The paper provides syntax, semantics, and proof theory, and shows SBTrust is sound, complete, and PSPACE-complete for satisfiability, with tractable model checking. By connecting to KLM and Åqvist FA84 and allowing multiple support systems via trust frames, SBTrust offers a flexible, integrative approach to reasoning about trust across cognitive, policy, and reputation factors. The framework lays groundwork for future extensions such as nesting, proofs, and dynamic multi-agent settings, broadening applicability to complex, real-world trust environments.

Abstract

We present SBTrust, a logical framework designed to formalize decision trust. Our logic integrates a doxastic modality with a novel non-monotonic conditional operator that establishes a positive support relation between statements, and is closely related to a known dyadic deontic modality. For SBTrust, we provide semantics, proof theory and complexity results, as well as motivating examples. Compared to existing approaches, our framework seamlessly accommodates the integration of multiple factors in the emergence of trust.
Paper Structure (11 sections, 13 theorems, 29 equations)

This paper contains 11 sections, 13 theorems, 29 equations.

Key Result

Theorem 1

The rules RW and LLE, as well as the axioms AND, CUT, and OR are derivable in the system for $\rightsquigarrow$.

Theorems & Definitions (57)

  • Example 1
  • Example 2: Contraposition and Modus Ponens
  • Example 3: CM
  • Example 4
  • Example 5
  • Example 6
  • Example 7
  • Example 8
  • Example 9
  • Example 10
  • ...and 47 more