Logics with Counting, Auxiliary Relations, and Lower Bounds for Invariant Queries - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Leonid Libkin. Logics with Counting, Auxiliary Relations, and Lower Bounds for Invariant Queries. In Proceedings, 14th Annual IEEE Symposium on Logic in Computer Science, 2-5 July, 1999, Trento, Italy. pages 316-325, IEEE Computer Society, 1999. [doi]

The following publications are possibly variants of this publication:

Lower bounds for invariant queries in logics with countingLeonid Libkin, Limsoon Wong. TCS, 288(1):153-180, 2002.

Pattern logics and auxiliary relationsDiego Figueira, Leonid Libkin. csl 2014: 40 [doi]

runs on WebDSL