PAC meditation on Boolean formulas

DOI10.1007/3-540-45622-8_20MaRDI QIDQ4737600zbMATH OpenFDO

Authors Fabio Baraghini, Giorgio Palmas, B. Apolloni

Publication date 11 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2371/23710274.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Learning rule representations from Boolean data
• Boolean formulas are hard to learn for most gate bases
• On the learnability of monotone \(k\mu\)-DNF formulae under product distributions
• A dichotomy theorem for learning quantified Boolean formulas
• Learning probabilistic read-once formulas on product distributions

Cited in

(4)

• Probably approximately correct interpolants generation
• Learning rule representations from Boolean data
• Gaining degrees of freedom in subsymbolic learning
• Feature selection via Boolean independent component analysis

This page was built for publication: PAC meditation on Boolean formulas

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