Deriving conclusions in expert systems when knowledge is incomplete

DOI10.1016/0305-0548(93)90095-ZzbMath0796.68181MaRDI QIDQ1201854

Cliff T. Ragsdale

Publication date: 17 January 1993

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

Horn clauseheuristic inferences

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Cites Work

• Unnamed Item
• Fusion, propagation, and structuring in belief networks
• Compact normal forms in propositional logic and integer programming formulations
• Modeling and integer programming techniques applied to propositional calculus
• Some results and experiments in programming techniques for propositional logic
• Question-asking strategies for Horn clause systems
• A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems
• Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base
• A Mathematical Programming Approach to Editing of Continuous Survey Data
• Fuzzy sets

This page was built for publication: Deriving conclusions in expert systems when knowledge is incomplete