On summarizing data using probabilistic assertions
Jacob Pearl · IEEE Transactions on Information Theory · 1977
The complexity of question-answering systems which are permitted to submit probabilistic estimates of the truth of certain propositions is considered. Bounds are derived on the expected memory space and computational work required to produce probabilistic estimates of a specified quality. The general features of the bounds are similar to those of question-answering systems constrained to true-false type answers.