Complexity issues in Basic Logic

DOI10.1007/S00500-004-0443-YMaRDI QIDQ816857zbMATH OpenOpenAlexFDO

Authors Stefano Aguzzoli, Brunella Gerla, Zuzana Haniková

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

surveysatisfiabilitycomplexity boundspropositional many-valued logicstautology

Mathematics Subject Classification ID

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

Recommendations

• Basic fuzzy logic and BL-algebras. II
• Computational complexity of infinite-valued Łukasiewicz propositional logic
• scientific article; zbMATH DE number 2042617
• Three complexity problems in quantified fuzzy logic
• Complexity Issues in Axiomatic Extensions of Lukasiewicz Logic

Cites work

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

Cited in

(17)

• Proof search in Hájek's basic logic
• The complexity of poor man's logic
• Disjunction property and complexity of substructural logics
• \(n\)-contractive BL-logics
• New complexity results for Łukasiewicz logic
• Three complexity problems in quantified fuzzy logic
• Approximation and universality of fuzzy Turing machines
• Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers
• scientific article; zbMATH DE number 2072508 (Why is no real title available?)
• Proof theory for locally finite many-valued logics: semi-projective logics
• Fuzzy Time in Linear Temporal Logic
• Approximation and robustness of fuzzy finite automata
• The consequence relation in the logic of commutative GBL-algebras is PSPACE-complete
• The complexity of 3-valued Łukasiewicz rules
• Computational complexities of axiomatic extensions of monoidal t-norm based logic
• MNiBLoS: a SMT-based solver for continuous t-norm based logics and some of their modal expansions
• Lattice-valued fuzzy Turing machines: computing power, universality and efficiency

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q816857)