scientific article; zbMATH DE number 1950788

MaRDI QIDQ4413504zbMATH OpenFDO

Authors 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

Mathematics Subject Classification ID

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

Recommendations

• Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
• Heavy-tailed phenomena and satisfiability and constraint satisfaction problems
• Randomised restarted search in ILP
• Inductive Logic Programming
• Principles and Practice of Constraint Programming – CP 2004

Cited in

(15)

• Parallel ILP for distributed-memory architectures
• The lattice structure and refinement operators for the hypothesis space bounded by a bottom clause
• Concept learning in description logics using refinement operators
• Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
• Learning hierarchical probabilistic logic programs
• On the use of stochastic local search techniques to revise first-order logic theories from examples
• Lifted discriminative learning of probabilistic logic programs
• Randomised restarted search in ILP
• Gleaner: Creating ensembles of first-order clauses to improve recall-precision curves
• Improving inductive logic programming by using simulated annealing
• Heavy-tailed phenomena and satisfiability and constraint satisfaction problems
• MetaBayes: Bayesian Meta-Interpretative Learning Using Higher-Order Stochastic Refinement
• Rapid restart hill climbing for learning description logic concepts
• Inductive Logic Programming
• Bandit-based Monte-Carlo structure learning of probabilistic logic programs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4413504)