Pages that link to "Item:Q5710721"

The following pages link to STACS 2005 (Q5710721):

Displaying 4 items.

• 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)