Formulating Template Consistency in Inductive Logic Programming as a Constraint Satisfaction Problem.
Roman BartákOndrej KuzelkaFilip ZeleznýPublished in: Abstraction, Reformulation, and Approximation (2010)
Keyphrases
- inductive logic programming
- constraint satisfaction problems
- constraint networks
- constraint satisfaction
- constraint problems
- path consistency
- background knowledge
- tractable subclasses
- relational learning
- disjunctive constraints
- constraint propagation
- arc consistency
- logic programs
- search space
- constraint programming
- np complete
- first order logic
- np hard
- rule learning
- non binary
- binary constraints
- machine learning
- logic programming
- global consistency
- partial constraint satisfaction
- randomly generated
- reasoning problems
- sat problem
- artificial intelligence
- sat solvers
- phase transition
- scheduling problem
- domain knowledge
- data mining