A sufficient condition for backtrack-bounded search
Journal of the ACM (JACM)
Tree clustering for constraint networks (research note)
Artificial Intelligence
A generic arc-consistency algorithm and its specializations
Artificial Intelligence
Fast parallel constraint satisfaction
Artificial Intelligence
Decomposing constraint satisfaction problems using database techniques
Artificial Intelligence
Characterising tractable constraints
Artificial Intelligence
On the minimality and global consistency of row-convex constraint networks
Journal of the ACM (JACM)
Tractable constraints on ordered domains
Artificial Intelligence
Local and global relational consistency
Theoretical Computer Science - Special issue: principles and practice of constraint programming
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
Closure properties of constraints
Journal of the ACM (JACM)
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
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
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
Constraints, consistency and closure
Artificial Intelligence
Constraint (Logic) Programming: A Survey on Research and Applications
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
Testing expressibility is hard
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
An algebraic characterisation of complexity for valued constraint
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Hi-index | 0.00 |
It is well-known that there is a trade-off between the expressive power of a constraint language and the tractability of the problems it can express. But how can you determine the expressive power of a given constraint language, and how can you tell if problems expressed in that language are tractable? In this paper we discuss some general approaches to these questions. We show that for languages over a finite domain the concept of an 'indicator problem' gives a universal construction for any constraint within the expressive power of a language. We also discuss the fact that all known tractable languages over finite domains are characterised by the presence of a particular solution to a corresponding indicator problem, and raise the question of whether this is a universal property of tractable languages.