Conjunctions of unate DNF formulas: Learning and structure

DOI10.1006/inco.1997.2684zbMath0895.68128OpenAlexW2072719628MaRDI QIDQ1383160

Lisa Hellerstein, Aaron Feigelson

Publication date: 20 September 1998

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/1fd79c149934f9672d41a35a3bd48d06f7c60ec7

zbMATH Keywords

query learningBoolean formulas

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

Polynomial certificates for propositional classes

Cites Work

• Queries and concept learning
• Exact learning Boolean functions via the monotone theory
• Learning read-once formulas with queries
• How many queries are needed to learn?

This page was built for publication: Conjunctions of unate DNF formulas: Learning and structure