Question-asking strategies for Horn clause systems

DOI10.1007/BF01531084zbMath0875.68805OpenAlexW2051120160MaRDI QIDQ1356226

O. Diekmann

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

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Related Items

Sequential testing of complex systems: a review, 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, Deriving conclusions in expert systems when knowledge is incomplete, A cost-reducing question-selection algorithm for propositional knowledge-based systems, Computer science and decision theory

Cites Work

• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base
• Unnamed Item
• Unnamed Item