Quantified Constraint Satisfaction Problem on Semicomplete Digraphs.
Petar DapicPetar MarkovicBarnaby MartinPublished in: ACM Trans. Comput. Log. (2017)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint programming
- constraint propagation
- search space
- arc consistency
- np complete
- constraint solving
- non binary
- np hard
- directed graph
- temporal constraints
- tree decompositions
- tractable subclasses
- finite domain
- constraint problems
- global constraints
- hard constraints
- tractable classes
- finding optimal solutions
- sat problem