Record link: 
http://hdl.handle.net/20.500.12708/163162
-
Title: 
First-order satisfiability in Gödel logics: an NP-complete fragment
en
Citation: 
Baaz, M., Ciabattoni, A., & Preining, N. (2011). First-order satisfiability in Gödel logics: an NP-complete fragment. Theoretical Computer Science, 412(47), 6612–6623. https://doi.org/10.1016/j.tcs.2011.07.015
-
Publisher DOI: 
10.1016/j.tcs.2011.07.015
-
Publication Type: 
Article - Original Research Article
en
Language: 
English
-
Authors: 
Baaz, Matthias 
Ciabattoni, Agata 
Preining, Norbert 
-
Organisational Unit: 
E104-02 - Forschungsbereich Computational Logic 
E192-05 - Forschungsbereich Theory and Logic 
-
Journal: 
Theoretical Computer Science 
-
ISSN: 
0304-3975
-
Date (published): 
2011
-
Number of Pages: 
12
-
Publisher: 
ELSEVIER
-
Peer reviewed: 
Yes
-
Keywords: 
Theoretical Computer Science; General Computer Science
-
Research Areas: 
Logic and Computation: 100%
-
Science Branch: 
Mathematik, Informatik
-
Appears in Collections:
Article

Show full item record

Page view(s)

99
checked on Nov 23, 2023

Google ScholarTM

Check