Syntactic Requirements for Well-defined Hybrid Probabilistic Logic Programs
This work addresses the need for reliable semantics in hybrid probabilistic logic programming, which is incremental as it builds on a recent semantics proposal.
The paper tackles the problem of ensuring well-defined semantics for hybrid probabilistic logic programs by analyzing syntactic requirements, resulting in a concrete syntax that preserves well-definedness.
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.