Skip to search formSkip to main contentSkip to account menu

Inductive logic programming

Known as: ILP 
Inductive logic programming (ILP) is a subfield of machine learning which uses logic programming as a uniform representation for examples, background… 
Wikipedia (opens in a new tab)

Related topics

Related topics

30 relations
Abductive logic programmingAction model learningArtificial intelligenceBayesian network

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Guaranteed Loop Bound Identification from Program Traces for WCET
Static analysis can be used to determine safe estimates of Worst Case Execution Time. However, overestimation of the number of… 
2007
2007
Modelling affective-based music compositional intelligence with the aid of ANS analyses
2006
2006
Quantitative pharmacophore models with inductive logic programming
Three-dimensional models, or pharmacophores, describing Euclidean constraints on the location on small molecules of functional… 
Highly Cited
2005
Highly Cited
2005
Support Vector Inductive Logic Programming
In this paper we explore a topic which is at the intersection of two areas of Machine Learning: namely Support Vector Machines… 
2004
2004
An Experiment in Using Inductive Logic Programming to Uncover Pointcuts
The subject of this paper is the transformation from pre-AOP legacy software to aspect-oriented software. To factor out… 
2002
2002
Discovering Dynamics: From Inductive Logic Programming To Machine Discovery
Machine discovery systems help humans to find natural laws from collections of experimentaUy collected data. Most of the laws… 
2002
2002
Runtime Service Composition via Logic-Based Program Synthesis
Dynamic composition of services from components at runtime can help to provide flexible service infrastructures, but requires… 
Review
2001
Review
2001
Machine Learning and Inductive Logic Programming for Multi-agent Systems
Learning is a crucial ability of intelligent agents. Rather than presenting a complete literature review, we focus in this paper… 
Highly Cited
1999
Highly Cited
1999
A Study of Relevance for Learning in Deductive Databases
1997
1997
On the complexity of some inductive logic programming problems
The bounded ILP-consistency problem for function-free Horn clauses is described as follows. Given at setE+ andE− of function-free… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)