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

DOI10.1016/S0020-0255(98)10095-6zbMath0946.68121OpenAlexW1991176166MaRDI QIDQ1818761

Yanyan Li

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)

Cites Work

• Occam's razor
• A theory of the learnable
• Unnamed Item
• Unnamed Item

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