Exact learning of subclasses of CDNF formulas with membership queries

DOI10.1007/3-540-61332-3_151MaRDI QIDQ6184662zbMATH OpenOpenAlexFDO

Authors Carlos Domingo

Publication date 29 January 2024

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2117/96475

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• scientific article; zbMATH DE number 67616
• Exact learning of DNF formulas using DNF hypotheses
• Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries
• Fast learning of \(k\)-term DNF formulas with queries.
• Exact learning Boolean functions via the monotone theory

Cites work

• A theory of the learnable
• Complexity of identification and dualization of positive Boolean functions
• Exact learning Boolean functions via the monotone theory
• scientific article; zbMATH DE number 1256690 (Why is no real title available?)
• scientific article; zbMATH DE number 1555949 (Why is no real title available?)
• Learning Decision Trees Using the Fourier Spectrum
• Learning read-once formulas with queries
• Queries and concept learning
• Read-twice DNF formulas are properly learnable

Cited in

(1)

• On exactly learning disjunctions and DNFs without equivalence queries

This page was built for publication: Exact learning of subclasses of CDNF formulas with membership queries

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