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...
Päätekijät: | Jefferson, C, Jeavons, P, Green, M, van Dongen, M |
---|---|
Aineistotyyppi: | Report |
Julkaistu: |
Oxford University Computing Laboratory
2007
|
Samankaltaisia teoksia
Symmetry definitions for constraint satisfaction problems
Tekijä: Cohen, D, et al.
Julkaistu: (2006)
Tekijä: Cohen, D, et al.
Julkaistu: (2006)
Samankaltaisia teoksia
-
Representing and solving finite-domain constraint problems using systems of polynomials
Tekijä: Jefferson, C, et al.
Julkaistu: (2013) -
Representing and solving finite−domain constraint problems using systems of polynomials
Tekijä: Jefferson, C, et al.
Julkaistu: (2013) -
Constraint satisfaction problems and finite algebras
Tekijä: Bulatov, A, et al.
Julkaistu: (2000) -
Constraint satisfaction problems and finite algebras
Tekijä: Bulatov, A, et al.
Julkaistu: (2000) -
A polynomial time solution to constraint satisfaction problems by neural−like P systems
Tekijä: Xu, L, et al.
Julkaistu: (2013)