@inproceedings{haase_et_al:LIPIcs.MFCS.2023.52,
    Address = {Dagstuhl, Germany},
    Annote = {Keywords: first-order theories, arithmetic theories, fixed-parameter tractability},
    Author = {Haase, Christoph and Mansutti, Alessio and Pouly, Amaury},
    BookTitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)},
    Editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David},
    File = {On Polynomial-Time Decidability of k-Negations Fragments of FO Theories (Extended Abstract) - LIPIcs-MFCS-2023-52.pdf},
    ISBN = {978-3-95977-292-1},
    ISSN = {1868-8969},
    Pages = {52:1--52:14},
    Publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
    Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
    Title = {{On Polynomial-Time Decidability of k-Negations Fragments of FO Theories (Extended Abstract)}},
    URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18586},
    Volume = {272},
    Year = {2023},
    bdsk-url-1 = {https://drops.dagstuhl.de/opus/volltexte/2023/18586},
    bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.MFCS.2023.52},
    date-added = {2023-08-26 08:16:18 +0200},
    date-modified = {2023-08-26 08:16:18 +0200},
    urn = {urn:nbn:de:0030-drops-185869},
    doi = {10.4230/LIPIcs.MFCS.2023.52}
}

@inproceedings{haase_et_al:LIPIcs.MFCS.2023.52, Address = {Dagstuhl, Germany}, Annote = {Keywords: first-order theories, arithmetic theories, fixed-parameter tractability}, Author = {Haase, Christoph and Mansutti, Alessio and Pouly, Amaury}, BookTitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)}, Editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David}, File = {On Polynomial-Time Decidability of k-Negations Fragments of FO Theories (Extended Abstract) - LIPIcs-MFCS-2023-52.pdf}, ISBN = {978-3-95977-292-1}, ISSN = {1868-8969}, Pages = {52:1--52:14}, Publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, Series = {Leibniz International Proceedings in Informatics (LIPIcs)}, Title = {{On Polynomial-Time Decidability of k-Negations Fragments of FO Theories (Extended Abstract)}}, URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18586}, Volume = {272}, Year = {2023}, bdsk-url-1 = {https://drops.dagstuhl.de/opus/volltexte/2023/18586}, bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.MFCS.2023.52}, date-added = {2023-08-26 08:16:18 +0200}, date-modified = {2023-08-26 08:16:18 +0200}, urn = {urn:nbn:de:0030-drops-185869}, doi = {10.4230/LIPIcs.MFCS.2023.52} }