Handbook of theoretical computer science (vol. A)
Journal of the ACM (JACM)
On the expressive power of Datalog: tools and a case study
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The complexity of G-free colourability
Proceedings of an international symposium on Graphs and combinatorics
Closure properties of constraints
Journal of the ACM (JACM)
Conjunctive-query containment and constraint satisfaction
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Regular Article: Universal Graphs with Forbidden Subgraphs and Algebraic Closure
Advances in Applied Mathematics
Duality theorems for finite structures (characterising gaps and good characterisations)
Journal of Combinatorial Theory Series B
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
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
The complexity of constraint satisfaction problems for small relation algebras
Artificial Intelligence
Relation Algebras and their Application in Temporal and Spatial Reasoning
Artificial Intelligence Review
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing
On Digraph Coloring Problems and Treewidth Duality
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Constraint Satisfaction with Countable Homogeneous Templates
Journal of Logic and Computation
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Journal of the ACM (JACM)
Constraint Satisfaction, Logic and Forbidden Patterns
SIAM Journal on Computing
Homomorphism preservation theorems
Journal of the ACM (JACM)
Constraints, consistency and closure
Artificial Intelligence
The complexity of temporal constraint satisfaction problems
Journal of the ACM (JACM)
Constraint Satisfaction Problems of Bounded Width
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Datalog and constraint satisfaction with infinite templates
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Qualitative temporal and spatial reasoning revisited
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
| Hi-index | 0.00 |
On finite structures, there is a well-known connection between the expressive power of Datalog, finite variable logics, the existential pebble game, and bounded hypertree duality. We study this connection for infinite structures. This has applications for constraint satisfaction with infinite templates. If the template @C is @w-categorical, we present various equivalent characterizations of those @C such that the constraint satisfaction problem (CSP) for @C can be solved by a Datalog program. We also show that CSP(@C) can be solved in polynomial time for arbitrary @w-categorical structures @C if the input is restricted to instances of bounded treewidth. Finally, we characterize those @w-categorical templates whose CSP has Datalog width 1, and those whose CSP has strict Datalog width k.