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)