Formulating the template ILP consistency problem as a constraint satisfaction problem.
Roman BartákRadomír CernochOndrej KuzelkaFilip ZeleznýPublished in: Constraints An Int. J. (2013)
Keyphrases
- constraint satisfaction problems
- constraint networks
- constraint satisfaction
- global constraints
- constraint problems
- path consistency
- tractable subclasses
- weighted constraint satisfaction
- constraint propagation
- inductive logic programming
- consistency checking
- disjunctive constraints
- constraint programming
- search space
- np complete
- binary constraints
- arc consistency
- constraint solving
- global consistency
- background knowledge
- non binary
- np hard
- finite domain
- product configuration
- forward checking
- constraint graph
- temporal reasoning
- partial constraint satisfaction
- soft constraints
- temporal constraints
- finding optimal solutions
- hard constraints
- matching algorithm
- constraint solver
- decomposition methods
- reducing the search space
- distributed constraint satisfaction problems
- phase transition
- search algorithm