GOLEM

swMATH24695MaRDI QIDQ36447

No author found.

Related Items (37)

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

This page was built for software: GOLEM