Some Lower Bounds for the Computational Complexity of Inductive Logic Programming.
Jörg-Uwe KietzPublished in: ECML (1993)
Keyphrases
- inductive logic programming
- lower bound
- computational complexity
- np hard
- background knowledge
- relational learning
- concept learning
- relational data mining
- np complete
- machine learning
- logic programs
- predicate invention
- branch and bound
- logic programming
- statistical relational learning
- objective function
- rule learner
- rule learning
- multi relational classification
- first order logic
- knowledge representation
- artificial intelligence
- domain knowledge
- multi relational
- ilp systems
- optimal solution
- knowledge base