To make an expert system work, we must store the statements that comprise expert knowledge. These statements usually have a degree of uncertainty associated with them, and these degrees of uncertainty are naturally described by intervals (sub-intervals of the interval [0, 1]). When we ask a query that is a logical combination of the statements stored in the system, we must, therefore, use interval computations to compute its resulting degree of certainty. In this paper, we prove that in general, computing these degrees of belief is intractable (NP-hard).
Reliable Computing – Springer Journals
Published: Oct 14, 2004
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.
Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.
All the latest content is available, no embargo periods.
“Hi guys, I cannot tell you how much I love this resource. Incredible. I really believe you've hit the nail on the head with this site in regards to solving the research-purchase issue.”Daniel C.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud
“I must say, @deepdyve is a fabulous solution to the independent researcher's problem of #access to #information.”@deepthiw
“My last article couldn't be possible without the platform @deepdyve that makes journal papers cheaper.”@JoseServera