An Efficient Algorithm for Reducing Clauses Based on Constraint Satisfaction Techniques.
Jérôme MalobertiEinoshin SuzukiPublished in: ILP (2004)
Keyphrases
- constraint satisfaction
- search space
- optimal solution
- computational complexity
- constraint satisfaction problems
- objective function
- dynamic programming
- heuristic search
- space complexity
- combinatorial problems
- highly efficient
- relaxation labeling
- particle swarm optimization
- search algorithm
- russian doll search
- backtracking algorithms
- constraint optimization
- constraint relaxation
- path consistency
- heuristic methods
- constraint programming
- arc consistency
- constraint propagation
- temporal reasoning
- search strategy
- machine learning
- combinatorial optimization
- tabu search
- simulated annealing
- learning algorithm