Conjunctions of unate DNF formulas: Learning and structure

DOI10.1006/INCO.1997.2684zbMATH Open0895.68128OpenAlexW2072719628MaRDI QIDQ1383160FDOQ1383160

Authors: Aaron Feigelson, Lisa Hellerstein 

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

Recommendations

• Exact learning of DNF formulas using DNF hypotheses
• Learning with queries inside the class of unate \(k\)-quasi-Horn formulas
• Learnability of DNF with representation-specific queries
• Complexity theoretic hardness results for query learning

zbMATH Keywords

query learningBoolean formulas

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

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

Cited In (8)

• Learning with queries inside the class of unate \(k\)-quasi-Horn formulas
• Learnability of quantified formulas.
• A dichotomy theorem for learning quantified Boolean formulas
• Learning a subclass of \(k\)-quasi-Horn formulas with membership queries
• Polynomial certificates for propositional classes
• Learnability of solutions to conjunctive queries
• Polynomial certificates for propositional classes.
• Algorithmic Learning Theory

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

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