The following pages link to (Q4255575):
Displayed 9 items.
- (Q4453869) (← links)
- Comparing the succinctness of monadic query languages over finite trees (Q4659888) (← links)
- Computable Queries for Object Oriented Databases (Q4916216) (← links)
- Expressibility of Higher Order Logics (Q4924534) (← links)
- A Practical Approach to Courcelle's Theorem (Q5170276) (← links)
- Constraint Satisfaction with Counting Quantifiers (Q5256528) (← links)
- CFI Construction and Balanced Graphs (Q5321700) (← links)
- The Relational Polynomial-Time Hierarchy and Second-Order Logic (Q5504578) (← links)
- Constraint Satisfaction Problems with Infinite Templates (Q5504704) (← links)