PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
August 20, 2025Theory and Practice of Logic Programming0 citationsOpen Access

Integrating Belief Domains into Probabilistic Logic Programs

View Full Paper
DADamiano AzzoliniFRFabrizio RiguzziTSTheresa Swift

Key Points

  • Interval-based Capacity Logic Programs improve reasoning under uncertainty, addressing limitations of point-probabilities.
  • The new framework incorporates belief functions, allowing for a deeper expression of epistemic uncertainty in classifications.
  • Probabilistic Logic Programming can now accommodate non-additive capacities, making it suitable for real-world applications.
  • Highlights the integration of belief domains as a vital step for enhancing practical reasoning in AI systems.

Abstract

Abstract Probabilistic Logic Programming (PLP) under the distribution semantics is a leading approach to practical reasoning under uncertainty. An advantage of the distribution semantics is its suitability for implementation as a Prolog or Python library, available through two well-maintained implementations, namely ProbLog and cplint/PITA. However, current formulations of the distribution semantics use point-probabilities, making it difficult to express epistemic uncertainty, such as arises from, for example, hierarchical classifications from computer vision models. Belief functions generalize probability measures as non-additive capacities and address epistemic uncertainty via interval probabilities. This paper introduces interval-based Capacity Logic Programs based on an extension of the distribution semantics to include belief functions and describes properties of the new framework that make it amenable to practical applications.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Azzolini et al. (2025) studied this question.

synapsesocial.com/papers/68af4eb4ad7bf08b1ead768bhttps://doi.org/10.1017/s1471068425100161
Ask AI
Helpful
Bookmark
Share
View Full Paper