Learning logic programs with structured background knowledge
From MaRDI portal
Recommendations
Cites work
- A theory of the learnable
- Classic learning
- Computational limitations on learning from examples
- Efficient noise-tolerant learning from statistical queries
- Equivalence of models for polynomial learnability
- First-order \(jk\)-clausal theories are PAC-learnable
- Foundations of inductive logic programming
- Homomorphisms to oriented paths
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 54155 (Why is no real title available?)
- scientific article; zbMATH DE number 1104356 (Why is no real title available?)
- scientific article; zbMATH DE number 1149414 (Why is no real title available?)
- scientific article; zbMATH DE number 1149415 (Why is no real title available?)
- scientific article; zbMATH DE number 194916 (Why is no real title available?)
- scientific article; zbMATH DE number 784360 (Why is no real title available?)
- scientific article; zbMATH DE number 803291 (Why is no real title available?)
- scientific article; zbMATH DE number 830356 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3349329 (Why is no real title available?)
- scientific article; zbMATH DE number 3412190 (Why is no real title available?)
- Inductive Logic Programming: Theory and methods
- Learnability and the Vapnik-Chervonenkis dimension
- Learning from examples and membership queries with structured determinations
- Learning function-free Horn expressions
- Learning logic programs with structured background knowledge
- Learning Simple Concepts under Simple Distributions
- Logical settings for concept-learning
- Multiplicativity. Part I. Variations, multiplicative graphs, and digraphs
- Multiplicativity. Part II. Nonmultiplicative digraphs and characterization of oriented paths
- On multiplicative graphs and the product conjecture
- Pac-learning non-recursive Prolog clauses
- Polynomial graph-colorings
- Probably Approximate Learning of Sets and Functions
- Robust logics
- Subsumption and implication
- The learnability of description logics with equality constraints
Cited in
(12)- An efficient multiple predicate learner
- A framework for incremental learning of logic programs
- Mining closed patterns in relational, graph and network data
- Complexity parameters for first order classes
- Prediction-hardness of acyclic conjunctive queries
- Weakening the language bias in LINUS
- scientific article; zbMATH DE number 1149414 (Why is no real title available?)
- Learning first-order definable concepts over structures of small degree
- Pac-learning non-recursive Prolog clauses
- Learning logic programs with structured background knowledge
- Polynomial-time learnability of logic programs with local variables from entailment
- Maximal closed set and half-space separations in finite closure systems
This page was built for publication: Learning logic programs with structured background knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5941133)
