Characterising tractable constraints
Artificial Intelligence
Closure properties of constraints
Journal of the ACM (JACM)
K-sat on groups and undecidability
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On the algebraic structure of combinatorial problems
Theoretical Computer Science
Constraints, consistency and closure
Artificial Intelligence
Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems
SIAM Journal on Computing
Polynomial algorithms for minimum cost paths in periodic graphs
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
The complexity of maximal constraint languages
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Constraints and universal algebra
Annals of Mathematics and Artificial Intelligence
A Dichotomy Theorem for Constraints on a Three-Element Set
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Closure Functions and Width 1 Problems
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
CP '02 Proceedings of the 8th 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
Theory of Periodically Specified Problems: Complexity and Approximability
COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
The complexity of dynamic languages and dynamic optimization problems
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We study a generalization of the constraint satisfaction problem (CSP), the periodic constraint satisfaction problem. An input instance of the periodic CSP is a finite set of "generating" constraints over a structured variable set that implicitly specifies a larger, possibly infinite set of constraints; the problem is to decide whether or not the larger set of constraints has a satisfying assignment. This model is natural for studying constraint networks consisting of constraints obeying a high degree of regularity or symmetry. Our main contribution is the identification of two broad polynomial-time tractable subclasses of the periodic CSP.