Logics with Counting, Auxiliary Relations, and Lower Bounds for Invariant Queries

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]

@inproceedings{Libkin99:0,
  title = {Logics with Counting, Auxiliary Relations, and Lower Bounds for Invariant Queries},
  author = {Leonid Libkin},
  year = {1999},
  url = {http://computer.org/conferen/proceed/lics/0158/01580316abs.htm},
  tags = {logic},
  researchr = {https://researchr.org/publication/Libkin99%3A0},
  cites = {0},
  citedby = {0},
  pages = {316-325},
  booktitle = {Proceedings, 14th Annual IEEE Symposium on Logic in Computer Science, 2-5 July, 1999, Trento, Italy},
  publisher = {IEEE Computer Society},
}