Version spaces and the consistency problem (Q814597)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	Version spaces and the consistency problem	scientific article

Statements

scholarly article

Version spaces and the consistency problem (English)

Artificial Intelligence

publication date

7 February 2006

zbMATH Keywords

Version spaces

Boundary sets

Consistency problem

Inductive learning

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1016/j.artint.2003.04.003

Complexity theoretic hardness results for query learning

On the learnability of disjunctive normal form formulas

Learnability and the Vapnik-Chervonenkis dimension

Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries

Identifying the Minimal Transversals of a Hypergraph and Related Problems

New Results on Monotone Dualization and Generating Hypergraph Transversals

Decision lists and related Boolean functions

On the Complexity of Dualization of Monotone Disjunctive Normal Forms

Quantifying inductive bias: AI learning algorithms and Valiant's learning framework

Generalizing version spaces

On generating all maximal independent sets

Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms

Programming by demonstration using version space algebra

Computational limitations on learning from examples

The Complexity of Enumeration and Reliability Problems

Identifiers

zbMATH Open document ID

10.1016/j.artint.2003.04.003

Mathematics Subject Classification ID

zbMATH DE Number

Sitelinks

Mathematics(1 entry)

mardi Publication:814597

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q814597&oldid=34860914"