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.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.
