Query Learning and Certificates in Lattices

DOI10.1007/978-3-540-87987-9_26MaRDI QIDQ3529930zbMATH OpenOpenAlexFDO

Authors Marta Arias, José L. Balcázar

Publication date 14 October 2008

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

Full work available at URL https://doi.org/10.1007/978-3-540-87987-9_26

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Polynomial certificates for propositional classes.
• Polynomial certificates for propositional classes
• Canonical Horn representations and query learning
• Probably approximately correct learning of Horn envelopes from queries
• Construction and learnability of canonical Horn formulas

Cited in

(6)

• Directed hypergraphs and Horn minimization
• Canonical Horn representations and query learning
• Construction and learnability of canonical Horn formulas
• Polynomial certificates for propositional classes.
• The query complexity of certification
• Learning Horn envelopes via queries from language models

This page was built for publication: Query Learning and Certificates in Lattices

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