New Tractable Classes From Old

Authors:
David Cohen;Peter Jeavons;Richard Gault
Affiliations:
Department of Computer Science Royal Holloway, University of London, UK;Oxford University Computing Laboratory Wolfson Building, Parks Road, Oxford, UK;Oxford University Computing Laboratory Wolfson Building, Parks Road, Oxford, UK
Venue:
Constraints
Year:
2003

Citing 21
Cited 1

Fast parallel constraint satisfaction

Artificial Intelligence
On binary constraint problems

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
From local to global consistency in temporal constraint networks

Theoretical Computer Science - Special issue: principles and practice of constraint programming
Closure properties of constraints

Journal of the ACM (JACM)
On the algebraic structure of combinatorial problems

Theoretical Computer Science
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

SIAM Journal on Computing
Computational complexity of relating time points with interval

Artificial Intelligence
Building tractable disjunctive constraints

Journal of the ACM (JACM)
The complexity of maximal constraint languages

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Constraints and universal algebra

Annals of Mathematics and Artificial Intelligence
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 complete classification of complexity in Allen's algebra in the presence of a non-trivial basic relation

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

Partition search for non-binary constraint satisfaction

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 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.