Finding optimal derivation strategies in redundant knowledge bases

DOI10.1016/0004-3702(91)90092-XzbMath0738.68076MaRDI QIDQ1182170

Russell Greiner

Publication date: 28 June 1992

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

NP-completenesscost of a derivation strategyredundant knowledge bases

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 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, PALO: a probabilistic hill-climbing algorithm, Speeding up inferences using relevance reasoning: a formalism and algorithms, Probably approximately optimal satisficing strategies, Finding optimal satisficing strategies for and-or trees, Testing systems of identical components, Bounding the cost of learned rules

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ordering conjunctive queries
• Controlling backward inference
• Optimal problem-solving search: All-or-none solutions