Author of the publication

Inference in credal networks: branch-and-bound methods and the A/R+ algorithm.

, and . Int. J. Approx. Reason., 39 (2-3): 279-296 (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Link prediction using a probabilistic description logic., , and . J. Braz. Comp. Soc., 19 (4): 397-409 (2013)Reasoning about shadows in a mobile robot environment., , , and . Appl. Intell., 38 (4): 553-565 (2013)The Joy of Probabilistic Answer Set Programming.. ISIPTA, volume 103 of Proceedings of Machine Learning Research, page 91-101. PMLR, (2019)Graphoid Properties of Variants of Epistemic Independence Based on Regular Conditioning.. ISIPTA, volume 103 of Proceedings of Machine Learning Research, page 102-110. PMLR, (2019)The Complexity of MAP Inference in Bayesian Networks Specified Through Logical Languages., , and . IJCAI, page 889-895. AAAI Press, (2015)Speeding up parameter and rule learning for acyclic probabilistic logic programs., , , , and . Int. J. Approx. Reason., (2019)The Complexity of Plate Probabilistic Models., and . SUM, volume 9310 of Lecture Notes in Computer Science, page 36-49. Springer, (2015)Random Generation of Bayesian Networks., and . SBIA, volume 2507 of Lecture Notes in Computer Science, page 366-375. Springer, (2002)Evidence Propagation in Credal Networks: An Exact Algorithm Based on Separately Specified Sets of Probability., and . SBIA, volume 2507 of Lecture Notes in Computer Science, page 376-385. Springer, (2002)Planning under Risk and Knightian Uncertainty., , and . IJCAI, page 2023-2028. (2007)