Dempster-Shafer Theory: Ηow Constraint Programming Can Help

DOI10.1007/978-3-030-50143-3_27MaRDI QIDQ6485252zbMATH OpenFDO

Authors Isambo Karali

Publication date 6 December 2022

Published in 1512.68358 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-50143-3_27

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Algorithms for Dempster-Shafer theory
• Dempster-shafer approach in propositional logic
• scientific article; zbMATH DE number 749936
• Using Logic to Understand Relations between DSmT and Dempster-Shafer Theory
• Toward a Dempster-Shafer theory of concepts
• A computationally efficient approximation of Dempster-Shafer theory
• Constraint satisfaction from a deductive viewpoint
• Constraint satisfaction using constraint logic programming
• The logic of constraint satisfaction
• Dempster-Shafer theory framed in modal logic

Cited in

(1)

• Certainty closure: reliable constraint reasoning with incomplete or erroneous data

This page was built for publication: Dempster-Shafer Theory: Ηow Constraint Programming Can Help

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