Natural language understanding (2nd ed.)
Natural language understanding (2nd ed.)
Constraint satisfaction in Prolog: complexity and theory-based heuristics
Information Sciences—Intelligent Systems: An International Journal
Closure properties of constraints
Journal of the ACM (JACM)
Constraint satisfaction and database theory: a tutorial
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Engineering Dynamic Scheduler for Work Manager
BT Technology Journal
Temporal Constraints: A Survey
Constraints
Constraint Satisfaction Problems and Finite Algebras
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Tractable conservative Constraint Satisfaction Problems
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Journal of the ACM (JACM)
A Simple Algorithm for Mal'tsev Constraints
SIAM Journal on Computing
Tractability and learnability arising from algebras with few subpowers
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Graphs, polymorphisms and the complexity of homomorphism problems
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Recent Results on the Algebraic Approach to the CSP
Complexity of Constraints
Dualities for Constraint Satisfaction Problems
Complexity of Constraints
Constraint Satisfaction Problems of Bounded Width
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
We show that a constraint language with compatible Jónsson terms (or, equivalently, associated with an algebra generating a congruence distributive variety) defines a constraint satisfaction problem solvable by the local consistency checking algorithm.