First-order \(jk\)-clausal theories are PAC-learnable
type: Item
instance of: scholarly article
title: First-order \(jk\)-clausal theories are PAC-learnable
zbMATH Open document ID: 0938.68773
DOI: 10.1016/0004-3702(94)90112-0
author: Luc De Raedt
author: Saso Dzeroski
published in: Artificial Intelligence
publication date: 2000-06-21T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 710226
describes a project that uses: GOLEM
MaRDI profile type: Publication
full work available at URL: 0004-3702(94)90112-0
OpenAlex ID: W2141288588
cites work: Learnability and the Vapnik-Chervonenkis dimension
cites work: Grammatically biased learning: Learning logic programs using an explicit antecedent description language
cites work: Q3972029
cites work: Q4004339
cites work: Inductive Logic Programming: Theory and methods
cites work: Probably Approximate Learning of Sets and Functions
cites work: Flattening and saturation: Two representation changes for generalization
cites work: Q3718124
cites work: A theory of the learnable
description: scientific article; zbMATH DE number 710226