Representing and Solving Finite−Domain Constraint Problems Using Systems of Polynomials
In this paper we investigate the use of a system of multivariate polynomials to represent the restrictions imposed by a collection of constraints. The advantage of using polynomials to represent constraints is that it allows many different forms of constraints to be treated in a uniform way. Systems...
Автори: | Jefferson, C, Jeavons, P, Green, M, van Dongen, M |
---|---|
Формат: | Report |
Опубліковано: |
Oxford University Computing Laboratory
2007
|
Схожі ресурси
Схожі ресурси
-
Representing and solving finite-domain constraint problems using systems of polynomials
за авторством: Jefferson, C, та інші
Опубліковано: (2013) -
Representing and solving finite−domain constraint problems using systems of polynomials
за авторством: Jefferson, C, та інші
Опубліковано: (2013) -
Constraint satisfaction problems and finite algebras
за авторством: Bulatov, A, та інші
Опубліковано: (2000) -
Constraint satisfaction problems and finite algebras
за авторством: Bulatov, A, та інші
Опубліковано: (2000) -
A polynomial time solution to constraint satisfaction problems by neural−like P systems
за авторством: Xu, L, та інші
Опубліковано: (2013)