scientific article; zbMATH DE number 1950788

zbMath1017.68537MaRDI QIDQ4413504

Filip Železný, Ashwin Srinivasan, David Page

Publication date: 20 July 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2583/25830333.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items (12)

On the use of stochastic local search techniques to revise first-order logic theories from examples ⋮ Rapid Restart Hill Climbing for Learning Description Logic Concepts ⋮ MetaBayes: Bayesian Meta-Interpretative Learning Using Higher-Order Stochastic Refinement ⋮ Bandit-based Monte-Carlo structure learning of probabilistic logic programs ⋮ Lifted discriminative learning of probabilistic logic programs ⋮ Randomised restarted search in ILP ⋮ Gleaner: Creating ensembles of first-order clauses to improve recall-precision curves ⋮ The lattice structure and refinement operators for the hypothesis space bounded by a bottom clause ⋮ Concept learning in description logics using refinement operators ⋮ Improving inductive logic programming by using simulated annealing ⋮ Parallel ILP for distributed-memory architectures ⋮ Learning hierarchical probabilistic logic programs

This page was built for publication: