First-order satisfiability in Gödel logics: an NP-complete fragment

From MaRDI portal
Publication:650893

DOI10.1016/j.tcs.2011.07.015zbMath1244.03090OpenAlexW2096504793MaRDI QIDQ650893

Agata Ciabattoni, Matthias Baaz, Norbert Preining

Publication date: 7 December 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.07.015




Related Items (2)



Cites Work




This page was built for publication: First-order satisfiability in Gödel logics: an NP-complete fragment