Complexity results and algorithms for possibilistic influence diagrams

From MaRDI portal
Publication:2389644

DOI10.1016/J.ARTINT.2007.11.008zbMATH Open1183.62133DBLPjournals/ai/GarciaS08OpenAlexW2077618895WikidataQ60558413 ScholiaQ60558413MaRDI QIDQ2389644FDOQ2389644


Authors: Laurent Garcia, Régis Sabbadin Edit this on Wikidata


Publication date: 17 July 2009

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2007.11.008




Recommendations




Cites Work


Cited In (11)





This page was built for publication: Complexity results and algorithms for possibilistic influence diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2389644)