The problem of asking the minimum number of questions in Horn clause systems

DOI10.1016/0895-7177(94)00164-2MaRDI QIDQ1344638zbMATH OpenOpenAlexFDO

Authors Evangelos Triantaphyllou, Jinchang Wang

Publication date 18 September 1995

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0895-7177(94)00164-2

zbMATH Keywords

backward chainingheuristic approachHorn clause rule basesinference enginequestion asking strategiesset cover problemstrategies in expert systems

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Management decision making, including multiple objectives (90B50)

Recommendations

• A cost effective question-asking strategy for Horn clause systems
• A cost-reducing question-selection algorithm for propositional knowledge-based systems
• Optimizing Expert Systems: Heuristics for Efficiently Generating Low-Cost Information Acquisition Strategies
• On a method of ranking questions in expert systems
• Learning to ask relevant questions

Cites work

• Diagnosing multiple faults
• Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Logic-based decision support. Mixed integer model formulation
• Question-asking strategies for Horn clause systems

Cited in

(3)

• A cost effective question-asking strategy for Horn clause systems
• A cost-reducing question-selection algorithm for propositional knowledge-based systems
• Smallest horn clause programs

This page was built for publication: The problem of asking the minimum number of questions in Horn clause systems

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