Updating credal networks is approximable in polynomial time

Denis Deratani Mauá, Cassio Polpo de Campos, Marco Zaffalon. Updating credal networks is approximable in polynomial time. Int. J. Approx. Reasoning, 53(8):1183-1199, 2012. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.