Anytime possibilistic propagation algorithm

DOI10.1007/3-540-46019-5_20MaRDI QIDQ4736953zbMATH OpenFDO

Authors Nahla Ben Amor, Salem Benferhat, Khaled Mellouli

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2311/23110263.htm

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• A Dynamic Algorithm for Network Propagation
• Anytime anyspace probabilistic inference
• scientific article; zbMATH DE number 597698
• Anytime algorithms for solving possibilistic MDPs and hybrid MDPs
• Propagation in CSP and SAT
• scientific article; zbMATH DE number 176880
• On the complexity of constant propagation
• A probabilistic anytime algorithm for the halting problem
• Positive semidefinite propagation time

Cited in

(6)

• Anytime clausal reasoning
• Anytime anyspace probabilistic inference
• Ordered valuation algebras: A generic framework for approximating inference
• Possibilistic conditional preference networks
• Quantitative possibility theory: logical- and graphical-based representations
• Representing interventional knowledge in causal belief networks: uncertain conditional distributions per cause

This page was built for publication: Anytime possibilistic propagation algorithm

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