First-order satisfiability in Gödel logics: an NP-complete fragment
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
satisfiabilitymonadic logicexpert system CADIAG-2 for medical diagnosisfirst-order Gödel logicone-variable fragment
Fuzzy logic; logic of vagueness (03B52) Medical applications (general) (92C50) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- T-norm-based logics with an independent involutive negation
- Continuous Fraïssé conjecture
- Metamathematics of fuzzy logic
- Embedding logics into product logic
- Residuated fuzzy logics with an involutive negation
- First-order Gödel logics
- On theories and models in fuzzy predicate logics
- Linear Kripke frames and Gödel logics
- Monadic Fragments of Gödel Logics: Decidability and Undecidability Results
- SAT in Monadic Gödel Logics: A Borderline between Decidability and Undecidability
- Intuitionistic fuzzy logic and intuitionistic fuzzy set theory
- On the completenes principle: A study of provability in heyting's arithmetic and extensions
- Algebraic Completeness Results for Dummett's LC and Its Extensions
- Strongly equivalent logic programs
This page was built for publication: First-order satisfiability in Gödel logics: an NP-complete fragment