Version spaces and the consistency problem

DOI10.1016/j.artint.2003.04.003zbMath1085.68626OpenAlexW2118646752MaRDI QIDQ814597

Nina Mishra, Haym Hirsh, Leonard Pitt

Publication date: 7 February 2006

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2003.04.003

zbMATH Keywords

Version spacesBoundary setsConsistency problemInductive learning

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (2)

Constraint acquisition ⋮ Resolution based algorithms for the transversal hypergraph generation problem

Cites Work

• Unnamed Item
• Unnamed Item
• Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
• On generating all maximal independent sets
• Complexity theoretic hardness results for query learning
• Generalizing version spaces
• Programming by demonstration using version space algebra
• On the learnability of disjunctive normal form formulas
• Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries
• Learnability and the Vapnik-Chervonenkis dimension
• Computational limitations on learning from examples
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• The Complexity of Enumeration and Reliability Problems
• Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
• New Results on Monotone Dualization and Generating Hypergraph Transversals
• Identifying the Minimal Transversals of a Hypergraph and Related Problems
• Decision lists and related Boolean functions

This page was built for publication: Version spaces and the consistency problem