Matthias Baaz, Agata Ciabattoni, Norbert Preining. First-order satisfiability in Gödel logics: An NP-complete fragment. Theoretical Computer Science, 412(47):6612-6623, 2011. [doi]
@article{BaazCP11,
title = {First-order satisfiability in Gödel logics: An NP-complete fragment},
author = {Matthias Baaz and Agata Ciabattoni and Norbert Preining},
year = {2011},
doi = {10.1016/j.tcs.2011.07.015},
url = {http://dx.doi.org/10.1016/j.tcs.2011.07.015},
researchr = {https://researchr.org/publication/BaazCP11},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {412},
number = {47},
pages = {6612-6623},
}