On the Hardness of Approximate Reasoning

  title={On the Hardness of Approximate Reasoning},
  author={Dan Roth},
  journal={Artif. Intell.},
Many AI problems, when formulated, reduce to evaluat ing the probabi l i ty that a preposit ional expression is t rue. In this paper we show tha t this problem is computat ional ly int ractable even in surpr is ingly restricted cases and even if we settle for an approx imat ion to this probabi l i ty . We consider various methods used in approximate reasoning such as comput ing degree of belief and Bayesian belief networks, as well as reasoning techniques such as constraint satisfact ion and… CONTINUE READING
Highly Influential
This paper has highly influenced 49 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS