Monotone term decision lists

DOI10.1016/S0304-3975(00)00043-8MaRDI QIDQ5941293zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Dualization, decision lists and identification of monotone discrete functions
• Partially monotonic decision trees
• Decision lists and related Boolean functions
• Monotone optimal decision rules and their computation
• Research note on decision lists
• Monotone concepts for formal concept analysis
• Decision lists and related classes of Boolean functions
• scientific article; zbMATH DE number 1927357
• Monotonic Answer Set Programming
• Monotone approximation of decision problems

Cites work

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

Cited in

(7)

• Research note on decision lists
• Lower bounds on learning decision lists and trees
• Learning a subclass of \(k\)-quasi-Horn formulas with membership queries
• Decision lists and related classes of Boolean functions
• scientific article; zbMATH DE number 2086400 (Why is no real title available?)
• Analysis of logical expressions of decision lists
• On exact learning of d-monotone functions

This page was built for publication: Monotone term decision lists

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