New tractable classes from old

The constraint satisfaction problem is known to be NP-hard in general, but a number of restrictions of the problem have been identified over the years which ensure tractability. This paper introduces two simple methods of combining two or more tractable classes over disjoint domains, in order to syn...

Full description

Bibliographic Details
Main Authors: Cohen, D, Jeavons, P, Gault, R
Format: Journal article
Language:English
Published: 2003