The combination of the expressiveness of Probabilistic Logic Programming with the possibility of managing constraints between random variables allows users to develop simple yet powerful models to describe many real-world situations. In this paper, we propose the class of Probabilistic Reducible Logic Programs, in which the goal is to minimize the number of facts while preserving the validity of the constraints on the distribution induced by the program. Furthermore, we propose a practical algorithm to perform this task.

Reducing probabilistic logic programs

Azzolini D.;Riguzzi F.
2021

Abstract

The combination of the expressiveness of Probabilistic Logic Programming with the possibility of managing constraints between random variables allows users to develop simple yet powerful models to describe many real-world situations. In this paper, we propose the class of Probabilistic Reducible Logic Programs, in which the goal is to minimize the number of facts while preserving the validity of the constraints on the distribution induced by the program. Furthermore, we propose a practical algorithm to perform this task.
2021
Constraints; Probabilistic logic programming; Statistical relational artificial intelligence
File in questo prodotto:
File Dimensione Formato  
paper5.pdf

accesso aperto

Descrizione: Full text editoriale
Tipologia: Full text (versione editoriale)
Licenza: Creative commons
Dimensione 310.34 kB
Formato Adobe PDF
310.34 kB Adobe PDF Visualizza/Apri

I documenti in SFERA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11392/2467218
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact