The paper presents two algoriothms for performing approximate inference on Logic Programs with Annotated Disjunctions: k-best and Monte Carlo. The first is based on branch and bound while the second is based on a stochastic approach.

Approximate Inference for Logic Programs with Annotated Disjunctions

RIGUZZI, Fabrizio
2009

Abstract

The paper presents two algoriothms for performing approximate inference on Logic Programs with Annotated Disjunctions: k-best and Monte Carlo. The first is based on branch and bound while the second is based on a stochastic approach.
2009
Probabilistic Reasoning; Probabilistic Logic Programming; Logic Programming; Logic Programs with Annotated Disjunctions
File in questo prodotto:
Non ci sono file associati a questo prodotto.

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/1394163
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact