Syntactic Requirements for Well-defined Hybrid Probabilistic Logic Programs

TL;DR

This paper explores the syntactic conditions necessary for hybrid probabilistic logic programs to have well-defined semantics, ensuring consistent probability assignments across diverse scenarios.

Contribution

It introduces a concrete syntax and analyzes syntactic requirements to maintain well-defined semantics for hybrid probabilistic logic programs.

Findings

Identifies syntactic conditions for well-definedness

Proposes a concrete syntax for hybrid probabilistic logic programs

Analyzes semantic preservation under syntactic constraints

Abstract

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.