Learning a logic program that effectively describes input data has been a long-standing goal in Artificial Intelligence, particularly within the field of Inductive Logic Programming. Learning it is even more challenging when information is uncertain, due to the inherent complexity of probabilistic reasoning. In this paper, we propose an approach based on an evolutionary algorithm to learn probabilistic logic programs. Our empirical evaluation shows that the proposed method outperforms existing tools in terms of log-likelihood, AUCROC, and AUCPR, while also providing more compact and interpretable theories.
Evolutionary learning of probabilistic logic programs
Azzolini D.
Primo
2025
Abstract
Learning a logic program that effectively describes input data has been a long-standing goal in Artificial Intelligence, particularly within the field of Inductive Logic Programming. Learning it is even more challenging when information is uncertain, due to the inherent complexity of probabilistic reasoning. In this paper, we propose an approach based on an evolutionary algorithm to learn probabilistic logic programs. Our empirical evaluation shows that the proposed method outperforms existing tools in terms of log-likelihood, AUCROC, and AUCPR, while also providing more compact and interpretable theories.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
1-s2.0-S0950705125009529-main.pdf
accesso aperto
Descrizione: Full text editoriale
Tipologia:
Full text (versione editoriale)
Licenza:
Creative commons
Dimensione
1.13 MB
Formato
Adobe PDF
|
1.13 MB | Adobe PDF | Visualizza/Apri |
I documenti in SFERA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


