Classic learning
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4162316 (Why is no real title available?)
- scientific article; zbMATH DE number 1149436 (Why is no real title available?)
- A four-valued semantics for terminological logics
- A hierarchy of tractable satisfiability problems
- A theory of the learnable
- Cryptographic limitations on learning Boolean formulae and finite automata
- Inductive logic programming
- Inference of finite automata using homing sequences
- Learnability and the Vapnik-Chervonenkis dimension
- Learning conjunctions of Horn clauses
- Learning from a consistently ignorant teacher
- Learning in the Presence of Malicious Errors
- Learning regular sets from queries and counterexamples
- On-line learning of rectangles and unions of rectangles
- Predicting \(\{ 0,1\}\)-functions on randomly drawn points
- Prediction-preserving reducibility
- Probability Inequalities for Sums of Bounded Random Variables
- Randomly fallible teachers: Learning monotone DNF with an incomplete membership oracle
- The learnability of description logics with equality constraints
- When won't membership queries help?
Cited in
(19)- Matching in Hybrid Terminologies
- Bisimulation-based concept learning in description logics
- The learnability of description logics with equality constraints
- Construction and learnability of canonical Horn formulas
- scientific article; zbMATH DE number 1884389 (Why is no real title available?)
- Learning conditional preference networks
- Learning unions of tree patterns using queries
- A logic for trial and error classifiers
- Exact learning of lightweight description logic ontologies
- Robust logics
- Pac-learning non-recursive Prolog clauses
- scientific article; zbMATH DE number 5222293 (Why is no real title available?)
- Computing the least common subsumer w.r.t. a background terminology
- A logic of ``black box classifier systems
- Learning elementary formal systems with queries.
- Parallel symmetric class expression learning
- Structural subsumption and least common subsumers in a description logic with existential and number restrictions
- Pac-learning non-recursive Prolog clauses
- Learning logic programs with structured background knowledge
This page was built for publication: Classic learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676240)
