On the Expressiveness of Rule-Based Systems for Reasoning with Uncertainty
Abstract
We demonstrate that classes of dependencies among beliefs held with uncertainty cannot be represented in rule-based systems in a natural or efficient manner. We trace these limitations to a fundamental difference between certain and uncertain reasoning. In particular, we show that beliefs held with certainty are more modular than uncertain beliefs. We argue that the limitations of the rule-based approach for expressing dependencies are a consequence of forcing nonmodular knowledge into a representation scheme originally c!esigtrect to represent modular beliefs. Finally, we describe cl representation technique that is related.to the rule-based framework yet is not limited in the types of dependencies that it can represent. I
Cite
Text
Heckerman and Horvitz. "On the Expressiveness of Rule-Based Systems for Reasoning with Uncertainty." AAAI Conference on Artificial Intelligence, 1987.Markdown
[Heckerman and Horvitz. "On the Expressiveness of Rule-Based Systems for Reasoning with Uncertainty." AAAI Conference on Artificial Intelligence, 1987.](https://mlanthology.org/aaai/1987/heckerman1987aaai-expressiveness/)BibTeX
@inproceedings{heckerman1987aaai-expressiveness,
title = {{On the Expressiveness of Rule-Based Systems for Reasoning with Uncertainty}},
author = {Heckerman, David and Horvitz, Eric},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1987},
pages = {121-126},
url = {https://mlanthology.org/aaai/1987/heckerman1987aaai-expressiveness/}
}