Published in: LIPIcs, Volume 363, 34th EACSL Annual Conference on Computer Science Logic (CSL 2026)
Zuzana Haniková and Filip Jankovec. Satisfiability in Łukasiewicz Logic and Its Unbounded Relative. In 34th EACSL Annual Conference on Computer Science Logic (CSL 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 363, pp. 14:1-14:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{hanikova_et_al:LIPIcs.CSL.2026.14,
author = {Hanikov\'{a}, Zuzana and Jankovec, Filip},
title = {{Satisfiability in {\L}ukasiewicz Logic and Its Unbounded Relative}},
booktitle = {34th EACSL Annual Conference on Computer Science Logic (CSL 2026)},
pages = {14:1--14:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-411-6},
ISSN = {1868-8969},
year = {2026},
volume = {363},
editor = {Guerrini, Stefano and K\"{o}nig, Barbara},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2026.14},
URN = {urn:nbn:de:0030-drops-254380},
doi = {10.4230/LIPIcs.CSL.2026.14},
annote = {Keywords: unbounded {\L}ukasiewicz Logic, {\L}ukasiewicz Logic, Abelian Logic, existential theory, computational complexity, NP-completeness}
}