Monotone term decision lists

DOI10.1016/S0304-3975(00)00043-8zbMath0972.68094OpenAlexW1990517470MaRDI QIDQ5941293

David Guijarro, Víctor Lavín, Vijay Raghavan

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00043-8

zbMATH Keywords

Boolean functionsmonotone term decision lists

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items

Learning a subclass of \(k\)-quasi-Horn formulas with membership queries

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equivalence of free Boolean graphs can be decided probabilistically in polynomial time
• On the necessity of Occam algorithms
• Learning decision trees from random examples
• On specifying Boolean functions by labelled examples
• Lower bounds on learning decision lists and trees
• Queries and concept learning
• Probably Approximate Learning of Sets and Functions
• Learnability of exclusive-or expansion based on monotone DNF formulas
• A theory of the learnable
• Graph-Based Algorithms for Boolean Function Manipulation
• Computational limitations on learning from examples
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• Learning Simple Concepts under Simple Distributions
• Learning read-once formulas with queries
• How many queries are needed to learn?