Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
On sufficient conditions for unsatisfiability of random formulas
Journal of the ACM (JACM)
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Journal of the ACM (JACM)
A combinatorial characterization of resolution width
Journal of Computer and System Sciences
A Logical Approach to Constraint Satisfaction
Complexity of Constraints
Affine systems of equations and counting infinitary logic
Theoretical Computer Science
The complexity of constraint satisfaction games and QCSP
Information and Computation
HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results
Graph Theory, Computational Intelligence and Thought
Constraint satisfaction, databases, and logic
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Decidable relationships between consistency notions for constraint satisfaction problems
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Local consistency and SAT-solvers
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Complexity of conservative constraint satisfaction problems
ACM Transactions on Computational Logic (TOCL)
On the CSP dichotomy conjecture
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Lower Bounds for Existential Pebble Games and k-Consistency Tests
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Local consistency and SAT-solvers
Journal of Artificial Intelligence Research
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Affine systems of equations and counting infinitary logic
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
The complexity of approximating bounded-degree Boolean #CSP
Information and Computation
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
Journal of the ACM (JACM)
Hi-index | 0.00 |