Bounding the cost of learned rules

DOI10.1016/S0004-3702(00)00025-4MaRDI QIDQ1575429zbMATH OpenFDO

Authors J. Kim, Paul S. Rosenbloom

Publication date 21 August 2000

Published in Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

problem solvingrule matchspeed up learningutility problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites work

• Finding optimal derivation strategies in redundant knowledge bases
• Investigating production system representations for non-combinatorial match
• Match algorithms for generalized Rete networks
• Ordering conjunctive queries

Cited in

(4)

• scientific article; zbMATH DE number 4166899 (Why is no real title available?)
• scientific article; zbMATH DE number 4166908 (Why is no real title available?)
• AI 2005: Advances in Artificial Intelligence
• Separate-and-conquer rule learning

This page was built for publication: Bounding the cost of learned rules

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