pdfformat: 

@InProceedings{kotek_et_al:LIPIcs:2016:6553, author = {Tomer Kotek and Helmut Veith and Florian Zuleger}, title = {{Monadic Second Order Finite Satisfiability and Unbounded TreeWidth}}, booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)}, pages = {13:113:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770224}, ISSN = {18688969}, year = {2016}, volume = {62}, editor = {JeanMarc Talbot and Laurent Regnier}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6553}, URN = {urn:nbn:de:0030drops65537}, doi = {10.4230/LIPIcs.CSL.2016.13}, annote = {Keywords: Monadic Second Order Logic MSO, Two variable Fragment with Counting C2, Finite decidability, Unbounded Treewidth, WS1S with Cardinality Constraints} }
Keywords:  Monadic Second Order Logic MSO, Two variable Fragment with Counting C2, Finite decidability, Unbounded Treewidth, WS1S with Cardinality Constraints  
Seminar:  25th EACSL Annual Conference on Computer Science Logic (CSL 2016)  
Issue date:  2016  
Date of publication:  29.08.2016 