Sandra Kiefer, Pascal Schweitzer. Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic. In Martin Grohe, Eric Koskinen, Natarajan Shankar, editors, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, July 5-8, 2016. pages 287-296, ACM, 2016. [doi]
@inproceedings{KieferS16a,
title = {Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic},
author = {Sandra Kiefer and Pascal Schweitzer},
year = {2016},
doi = {10.1145/2933575.2933595},
url = {http://doi.acm.org/10.1145/2933575.2933595},
researchr = {https://researchr.org/publication/KieferS16a},
cites = {0},
citedby = {0},
pages = {287-296},
booktitle = {Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, July 5-8, 2016},
editor = {Martin Grohe and Eric Koskinen and Natarajan Shankar},
publisher = {ACM},
isbn = {978-1-4503-4391-6},
}