GOLEM

swMATH24695MaRDI QIDQ36447FDOQ36447

Author name not available (Why is that?)

Cited In (37)

• An efficient multiple predicate learner
• Structured machine learning: the next ten years
• Complexity parameters for first order classes
• Relational IBL in classical music
• Exploiting domain knowledge to detect outliers
• Inductive logic programming at 30
• Learning efficient logic programs
• The learnability of description logics with equality constraints
• E-generalization using grammars
• Inductive equivalence in clausal logic and nonmonotonic logic programming
• Machine learning techniques to make computers easier to use
• First-order \(jk\)-clausal theories are PAC-learnable
• ProGolem: A System Based on Relative Minimal Generalisation
• Data and task parallelism in ILP using mapreduce
• Generalizing predicates with string arguments
• The appropriateness of predicate invention as bias shift operation in ILP
• Logical settings for concept-learning
• A note on batch and incremental learnability
• Inductive logic programming
• Stochastic Refinement
• Title not available (Why is that?)
• QG/GA: a stochastic search for Progol
• Learning closed Horn expressions
• Parallel ILP for distributed-memory architectures
• Title not available (Why is that?)
• Pac-learning non-recursive Prolog clauses
• Analytical Inductive Functional Programming
• Logical debugging
• The lattice structure and refinement operators for the hypothesis space bounded by a bottom clause
• Logical reduction of metarules
• ILP turns 20. Biography and future challenges
• Ultra-strong machine learning: comprehensibility of programs learned with ILP
• Pac-learning non-recursive Prolog clauses
• Learning logic programs with structured background knowledge
• Introducing new predicates to model scientific revolution
• Inductive Logic Programming: Issues, results and the challenge of Learning Language in Logic
• Toward effective knowledge acquisition with first-order logic induction.

This page was built for software: GOLEM