@InProceedings{bulatov_et_al:LIPIcs.CSL.2013.149,
author = {Bulatov, Andrei and Dalmau, Victor and Thurley, Marc},
title = {{Descriptive complexity of approximate counting CSPs}},
booktitle = {Computer Science Logic 2013 (CSL 2013)},
pages = {149--164},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-60-6},
ISSN = {1868-8969},
year = {2013},
volume = {23},
editor = {Ronchi Della Rocca, Simona},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2013.149},
URN = {urn:nbn:de:0030-drops-41955},
doi = {10.4230/LIPIcs.CSL.2013.149},
annote = {Keywords: Constraint Satisfaction Problems, Approximate Counting, Descriptive Complexity}
}