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...
Auteurs principaux: | Jefferson, C, Jeavons, P, Green, M, van Dongen, M |
---|---|
Format: | Report |
Publié: |
Oxford University Computing Laboratory
2007
|
Documents similaires
-
Representing and solving finite-domain constraint problems using systems of polynomials
par: Jefferson, C, et autres
Publié: (2013) -
Representing and solving finite−domain constraint problems using systems of polynomials
par: Jefferson, C, et autres
Publié: (2013) -
Constraint satisfaction problems and finite algebras
par: Bulatov, A, et autres
Publié: (2000) -
Constraint satisfaction problems and finite algebras
par: Bulatov, A, et autres
Publié: (2000) -
A polynomial time solution to constraint satisfaction problems by neural−like P systems
par: Xu, L, et autres
Publié: (2013)