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

DOI10.1016/0895-7177(94)00164-2zbMath0820.90061OpenAlexW2029612760MaRDI QIDQ1344638

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

heuristic approachbackward chaininginference engineset cover problemHorn clause rule basesquestion asking strategiesstrategies in expert systems

Mathematics Subject Classification ID

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

Related Items (2)

A cost effective question-asking strategy for Horn clause systems ⋮ A cost-reducing question-selection algorithm for propositional knowledge-based systems

Cites Work

• Unnamed Item
• Diagnosing multiple faults
• Logic-based decision support. Mixed integer model formulation
• Question-asking strategies for Horn clause systems
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base

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