Computing the value of a Boolean expression with interval inputs is NP-hard

DOI10.1023/A:1009937906231MaRDI QIDQ1362918zbMATH OpenOpenAlexFDO

Authors Leticia S. Chee

Publication date 14 December 1997

Published in Reliable Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1009937906231

zbMATH Keywords

expert knowledge

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Recommendations

• Interval-valued degrees of belief: applications of interval computations to expert systems and intelligent control
• A bright side of NP-hardness of interval computations: Interval heuristics applied to NP-problems
• Interval-type and affine arithmetic-type techniques for handling uncertainty in expert systems
• Publication:3197358
• Why intervals? Because if we allow other sets, tractable problems become intractable

Cited in

(1)

• Interval-valued degrees of belief: applications of interval computations to expert systems and intelligent control

This page was built for publication: Computing the value of a Boolean expression with interval inputs is NP-hard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362918)