The PAC-learnability of planning algorithms: Investigating simple planning domains
type: Item
instance of: scholarly article
title: The PAC-learnability of planning algorithms: Investigating simple planning domains
zbMATH Open document ID: 0946.68121
DOI: 10.1016/S0020-0255(98)10095-6
author: Yanyan Li
published in: Information Sciences
publication date: 2000-10-30T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 1384382
zbMATH Keywords: speedup learning
zbMATH Keywords: search algorithms
MaRDI profile type: Publication
cites work: A theory of the learnable
cites work: Q4013527
cites work: Occam's razor
cites work: Q4004178
full work available at URL: s0020-0255(98)10095-6
OpenAlex ID: W1991176166
description: scientific article; zbMATH DE number 1384382