Opening book details…
About this Computer Science article
First-order satisfiability in Gödel logics: An NP-complete fragment by Matthias Baaz; Agata Ciabattoni; Norbert Preining is a Computer Science article available to read on EtoBox.
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Matthias Baaz; Agata Ciabattoni; Norbert Preining
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0304-3975)
- Published
- 2011
- Language
- EN
- Field
- Computer Science (Physical Sciences)
More by Matthias Baaz; Agata Ciabattoni; Norbert Preining
Browse all works by Matthias Baaz; Agata Ciabattoni; Norbert Preining