Building tractable disjunctive constraints
Journal of the ACM (JACM)
Constraints and universal algebra
Annals of Mathematics and Artificial Intelligence
Learnability of quantified formulas
Theoretical Computer Science
A new tractable class of constraint satisfaction problems
Annals of Mathematics and Artificial Intelligence
A polynomial-time algorithm for near-unanimity graphs
Journal of Algorithms
The expressive rate of constraints
Annals of Mathematics and Artificial Intelligence
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Journal of the ACM (JACM)
H-Coloring dichotomy revisited
Theoretical Computer Science - Graph colorings
The complexity of soft constraint satisfaction
Artificial Intelligence
A rendezvous of logic, complexity, and algebra
ACM SIGACT News
Towards a dichotomy theorem for the counting constraint satisfaction problem
Information and Computation
Learning intersection-closed classes with signatures
Theoretical Computer Science
Efficient interval partitioning-Local search collaboration for constraint satisfaction
Computers and Operations Research
Extracting social laws from unilateral binary constraint relation topologies in multiagent systems
Expert Systems with Applications: An International Journal
Domain permutation reduction for constraint satisfaction problems
Artificial Intelligence
Majority constraints have bounded pathwidth duality
European Journal of Combinatorics
Properties of tree convex constraints
Artificial Intelligence
The expressive power of valued constraints: Hierarchies and collapses
Theoretical Computer Science
Relatively quantified constraint satisfaction
Constraints
Existentially restricted quantified constraint satisfaction
Information and Computation
A new line of attack on the dichotomy conjecture
Proceedings of the forty-first annual ACM symposium on Theory of computing
The complexity of constraint satisfaction games and QCSP
Information and Computation
Collapsibility and consistency in quantified constraint satisfaction
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Simple randomized algorithms for tractable row and tree convex constraints
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Note: The expressive power of binary submodular functions
Discrete Applied Mathematics
Reasoning on interval and point-based disjunctive metric constraints in temporal contexts
Journal of Artificial Intelligence Research
Fault tolerant Boolean satisfiability
Journal of Artificial Intelligence Research
Amalgams of constraint satisfaction problems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Constraint satisfaction, databases, and logic
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Making bound consistency as effective as arc consistency
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
| Hi-index | 0.01 |