The following pages link to STACS 2005 (Q5710721):
Displaying 6 items.
- The guarded fragment with transitive guards (Q1877098) (← links)
- Data-complexity of the two-variable fragment with counting quantifiers (Q2389348) (← links)
- Answering regular path queries mediated by unrestricted \(\mathcal{SQ}\) ontologies (Q2680773) (← links)
- The two‐variable fragment with counting and equivalence (Q3460527) (← links)
- Two-Variable Logic with Counting and Trees (Q5278191) (← links)
- Logics in Artificial Intelligence (Q5394138) (← links)