Complexity issues in Basic Logic

DOI10.1007/s00500-004-0443-yzbMath1093.03010OpenAlexW2008823310MaRDI QIDQ816857

Zuzana Haniková, Brunella Gerla, Stefano Aguzzoli

Publication date: 2 March 2006

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-004-0443-y

zbMATH Keywords

surveysatisfiabilitytautologycomplexity boundspropositional many-valued logics

Mathematics Subject Classification ID

Fuzzy logic; logic of vagueness (03B52) Complexity of computation (including implicit computational complexity) (03D15) Many-valued logic (03B50)

Related Items (11)

Computational complexities of axiomatic extensions of monoidal t-norm based logic ⋮ Fuzzy Time in Linear Temporal Logic ⋮ Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers ⋮ Approximation and universality of fuzzy Turing machines ⋮ Disjunction property and complexity of substructural logics ⋮ Approximation and robustness of fuzzy finite automata ⋮ MNiBLoS: a SMT-based solver for continuous t-norm based logics and some of their modal expansions ⋮ The consequence relation in the logic of commutative GBL-algebras is PSPACE-complete ⋮ New complexity results for Łukasiewicz logic ⋮ Lattice-valued fuzzy Turing machines: computing power, universality and efficiency ⋮ The Complexity of 3-Valued Łukasiewicz Rules

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the structure of semi-groups on a compact manifold with boundary
• Satisfiability in many-valued sentential logic is NP-complete
• Metamathematics of fuzzy logic
• Standard algebras for fuzzy propositional calculi
• Finite-valued reductions of infinite-valued logics
• Semi-normal forms and functional representation of product fuzzy logic.
• Embedding logics into product logic
• Varieties of BL-algebras. I: General properties.
• Equational characterization of the subvarieties of BL generated by t-norm algebras
• Many-valued logic and mixed integer programming
• Finiteness in infinite-valued Łukasiewicz logic
• Residuated fuzzy logics with an involutive negation
• Fragments of Many-Valued Statement Calculi
• A constructive proof of McNaughton's theorem in infinite-valued logic
• A theorem about infinite-valued sentential logic
• A note on functions associated with Gödel formulas
• Complexity of t-tautologies

This page was built for publication: Complexity issues in Basic Logic