The PAC-learnability of planning algorithms: Investigating simple planning domains

DOI10.1016/S0020-0255(98)10095-6MaRDI QIDQ1818761zbMATH OpenOpenAlexFDO

Authors Yanyan Li, R. D. Dormer, C. MacNish

Publication date 30 October 2000

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0255(98)10095-6

zbMATH Keywords

search algorithmsspeedup learning

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)

Recommendations

• scientific article; zbMATH DE number 1149430
• Learning action strategies for planning domains
• Publication:4714286
• Learning generalized policies from planning examples using concept languages
• A theory of the learnable

Cites work

• A theory of the learnable
• scientific article; zbMATH DE number 53984 (Why is no real title available?)
• scientific article; zbMATH DE number 67611 (Why is no real title available?)
• Occam's razor

Cited in

(1)

• Learning generalized policies from planning examples using concept languages

This page was built for publication: The PAC-learnability of planning algorithms: Investigating simple planning domains

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