Dynamic algorithms for classes of constraint satisfaction problems.
Daniele FrigioniAlberto Marchetti-SpaccamelaUmberto NanniPublished in: Theor. Comput. Sci. (2001)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- backtracking search
- non binary
- tractable classes
- computational problems
- tractable subclasses
- constraint programming
- decomposition methods
- pseudo boolean optimization
- finding optimal solutions
- problems in artificial intelligence
- constraint optimization
- forward checking
- reasoning problems
- constraint propagation
- constraint problems
- backtracking algorithm
- path consistency
- orders of magnitude
- optimization problems
- graph based representations
- search space
- computational complexity
- objective function
- combinatorial problems
- arc consistency algorithm