A cost effective question-asking strategy for Horn clause systems

DOI10.1007/BF02127975MaRDI QIDQ1380433zbMATH OpenFDO

Authors Jinchang Wang, Evangelos Triantaphyllou

Publication date 4 March 1998

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

knowledge based systems

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• The problem of asking the minimum number of questions in Horn clause systems
• A cost-reducing question-selection algorithm for propositional knowledge-based systems
• Learning to ask relevant questions
• Inference guiding in propositional knowledge bases

Cites work

• scientific article; zbMATH DE number 194580 (Why is no real title available?)
• Diagnosing multiple faults
• Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Optimal Testing Procedures for Special Structures of Coherent Systems
• Question-asking strategies for Horn clause systems
• Some Reliability Fault-Testing Models
• The problem of asking the minimum number of questions in Horn clause systems

Cited in

(4)

• Learning to ask relevant questions
• Sequential testing of complex systems: a review
• A cost-reducing question-selection algorithm for propositional knowledge-based systems
• The problem of asking the minimum number of questions in Horn clause systems

This page was built for publication: A cost effective question-asking strategy for Horn clause systems

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