A sufficient condition for backtrack-bounded search
Journal of the ACM (JACM)
Tree clustering for constraint networks (research note)
Artificial Intelligence
Fast parallel constraint satisfaction
Artificial Intelligence
Journal of the ACM (JACM)
Characterising tractable constraints
Artificial Intelligence
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
Journal of the ACM (JACM)
On the minimality and global consistency of row-convex constraint networks
Journal of the ACM (JACM)
Tractable constraints on ordered domains
Artificial Intelligence
Closure properties of constraints
Journal of the ACM (JACM)
On the algebraic structure of combinatorial problems
Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An Algebraic Characterization of Tractable Constraints
COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
Exploiting Bipartiteness to Identify Yet Another Tractable Subclass of CSP
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Closure Functions and Width 1 Problems
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
A Unifying Framework for Tractable Constraints
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
A new tractable class of constraint satisfaction problems
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
Many combinatorial problems can be naturally expressed as "constraint satisfaction problems". This class of problems is known to be NP-hard in general, but a number of restrictions of the general problem have been identified which ensure tractability. This paper introduces a method of combining two or more tractable classes over disjoint domains, in order to synthesise larger, more expressive tractable classes. We demonstrate that the classes so obtained are genuinely novel, and have not been previously identified. In addition, we use algebraic techniques to extend the tractable classes which we identify, and to show that the algorithms for solving these extended classes can be less than obvious.