An Analysis of ATMS-Based Techniques for Computing Dempster-Shafer Belief Functions
Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Commonsense Reasoning. Pages 1115-1119.
Abstract
This paper analyzes the theoretical underpinnings of recent proposals for computing Dempster-Shafer Belief functions from ATMS labels. Such proposals are intended to be a means of integrating symbolic and numeric representation methods and of focusing search in the ATMS. This synthesis is formalized using graph theory, thus showing the relationship between graph theory, the logic-theoretic ATMS description and the set-theoretic Dempster Shafer Theory description. The computational complexity of calculating Belief functions from ATMS labels using algorithms originally derived to calculate the network reliability of graphs is analyzed. Approximation methods to more efficiently compute Belief functions using this graphical approach are suggested.
@inproceedings{ijcai1989p179,
title = {An Analysis of ATMS-Based Techniques for Computing Dempster-Shafer Belief Functions},
author = {Provan, Gregory M.},
booktitle = {Proceedings of the Eleventh International Joint Conference on
Artificial Intelligence, {IJCAI-89}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {N. S. Sridharan},
pages = {1115--1119},
year = {1989},
month = {8},
note = {Commonsense Reasoning},
url = {https://ijcai.org/proceedings/1989/179},
}
TY - CPAPER TI - An Analysis of ATMS-Based Techniques for Computing Dempster-Shafer Belief Functions AU - Provan, Gregory M. T2 - Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89 PB - International Joint Conferences on Artificial Intelligence PY - 1989 SP - 1115 EP - 1119 UR - https://ijcai.org/proceedings/1989/179 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
