Disjunctions, independence, refinements
Artificial Intelligence
Refinements and Independence: A Simple Method for Identifying Tractable Disjunctive Constraints
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Domain permutation reduction for constraint satisfaction problems
Artificial Intelligence
Properties of tree convex constraints
Artificial Intelligence
Solving connected row convex constraints by variable elimination
Artificial Intelligence
Simple randomized algorithms for tractable row and tree convex constraints
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Tractable classes of metric temporal problems with domain rules
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
A maximal tractable class of soft constraints
Journal of Artificial Intelligence Research
Making bound consistency as effective as arc consistency
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Towards automated reasoning on the properties of numerical constraints
ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
On the tractability of smooth constraint satisfaction problems
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
| Hi-index | 0.00 |