Identifying Compelled Edges in a DAG - A Constraint Satisfaction Problem.
S. K. Michael WongDan WuPublished in: IC-AI (2002)
Keyphrases
- constraint satisfaction problems
- directed acyclic graph
- constraint satisfaction
- constraint propagation
- np complete
- constraint programming
- non binary
- constraint solving
- constraint networks
- search space
- arc consistency
- np hard
- partial constraint satisfaction
- global constraints
- soft constraints
- constraint problems
- directed graph
- pseudo boolean optimization
- decomposition methods
- undirected graph
- temporal constraints
- product configuration
- tractable subclasses
- tractable classes
- graph based representations
- disjunctive temporal