@inproceedings{Lechner:2015:CLA:2876514.2876573,
    Address = {Washington, DC, USA},
    Author = {Lechner, Antonia and Ouaknine, Joel and Worrell, James},
    BookTitle = {Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
    File = {LICS-main (0) (0) - a - a - c.pdf},
    ISBN = {978-1-4799-8875-4},
    Pages = {667--676},
    Publisher = {IEEE Computer Society},
    Series = {LICS '15},
    Title = {On the Complexity of Linear Arithmetic with Divisibility},
    URL = {https://doi.org/10.1109/LICS.2015.67},
    Year = {2015},
    acmid = {2876573},
    bdsk-url-1 = {https://doi.org/10.1109/LICS.2015.67},
    date-added = {2019-03-12 20:22:39 +0100},
    date-modified = {2019-03-12 20:22:39 +0100},
    numpages = {10},
    doi = {10.1109/LICS.2015.67}
}

@inproceedings{Lechner:2015:CLA:2876514.2876573, Address = {Washington, DC, USA}, Author = {Lechner, Antonia and Ouaknine, Joel and Worrell, James}, BookTitle = {Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)}, File = {LICS-main (0) (0) - a - a - c.pdf}, ISBN = {978-1-4799-8875-4}, Pages = {667--676}, Publisher = {IEEE Computer Society}, Series = {LICS '15}, Title = {On the Complexity of Linear Arithmetic with Divisibility}, URL = {https://doi.org/10.1109/LICS.2015.67}, Year = {2015}, acmid = {2876573}, bdsk-url-1 = {https://doi.org/10.1109/LICS.2015.67}, date-added = {2019-03-12 20:22:39 +0100}, date-modified = {2019-03-12 20:22:39 +0100}, numpages = {10}, doi = {10.1109/LICS.2015.67} }