Learning intersection-closed classes with signatures

DOI10.1016/J.TCS.2007.03.039MaRDI QIDQ2381578zbMATH OpenOpenAlexFDO

Authors Andrei A. Bulatov, Hubie Chen, Víctor Dalmau

Publication date 18 September 2007

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10230/36326

zbMATH Keywords

polymorphismcomputational learningquantified formulasclosure algorithm

Mathematics Subject Classification ID

Computational learning theory (68Q32) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 67609
• Queries and concept learning
• Learning Theory
• A new PAC bound for intersection-closed concept classes
• scientific article; zbMATH DE number 1559548

Cites work

• scientific article; zbMATH DE number 2089366 (Why is no real title available?)
• scientific article; zbMATH DE number 2118880 (Why is no real title available?)
• A dichotomy theorem for learning quantified Boolean formulas
• A theory of the learnable
• Computer Science Logic
• Computer Science Logic
• Constraints, consistency and closure
• Learnability of quantified formulas.
• Learning Integer Lattices
• On-line learning with malicious noise and the closure algorithm
• Predicting \(\{ 0,1\}\)-functions on randomly drawn points
• Queries and concept learning
• STACS 2005

Cited in

(5)

• scientific article; zbMATH DE number 67609 (Why is no real title available?)
• Varieties with few subalgebras of powers
• The subpower membership problem for finite algebras with cube terms
• Learnability of solutions to conjunctive queries
• Learning Theory

This page was built for publication: Learning intersection-closed classes with signatures

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