mlsanityData to 7 Oct 2026

Syntactic Requirements for Well-defined Hybrid Probabilistic Logic Programs

arXiv 2109.08283 ↗First posted 17 Sep 2021cs.LO cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

Hybrid probabilistic logic programs can represent several scenarios thanks to the expressivity of Logic Programming extended with facts representing discrete and continuous distributions. The semantics for this type of programs is crucial since it ensures that a probability can be assigned to every query. Here, following one recent semantics proposal, we illustrate a concrete syntax, and we analyse the syntactic requirements needed to preserve the well-definedness.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 3 of its 25 references that are in the map. First posted on arXiv 17 Sep 2021.

Builds on

3 of 25 references.

References · 3

  1. 2020Symbolic Logic meets Machine Learning: A Brief Survey in Infinite Domainscited by 16
  2. 2017On the Semantics and Complexity of Probabilistic Logic Programscited by 9
  3. 2018Knowledge Compilation with Continuous Random Variables and its Application in Hybrid Probabilistic Logic Programmingcited by 1

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 1.

2 papers.