Question-asking strategies for Horn clause systems
From MaRDI portal
Publication:1356226
DOI10.1007/BF01531084zbMath0875.68805MaRDI QIDQ1356226
Publication date: 9 November 1997
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01531084
68W10: Parallel algorithms in computer science
68T35: Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence
Related Items
Deriving conclusions in expert systems when knowledge is incomplete, Recognition of \(q\)-Horn formulae in linear time, The problem of asking the minimum number of questions in Horn clause systems, Polynomial-time inference of all valid implications for Horn and related formulae, A cost effective question-asking strategy for Horn clause systems, A cost-reducing question-selection algorithm for propositional knowledge-based systems, Sequential testing of complex systems: a review, Computer science and decision theory
Cites Work