The Complexity of 3-Valued Łukasiewicz Rules

DOI10.1007/978-3-319-23240-9_18zbMath1366.68086OpenAlexW2247863957MaRDI QIDQ5268448

Amanda Vidal, Miquel Bofill, Felip Manyà, Mateu Villaret

Publication date: 20 June 2017

Published in: Modeling Decisions for Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23240-9_18

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Many-valued logic (03B50)

Related Items (4)

A first polynomial non-clausal class in many-valued logic ⋮ MNiBLoS: a SMT-based solver for continuous t-norm based logics and some of their modal expansions ⋮ New complexity results for Łukasiewicz logic ⋮ The Complexity of 3-Valued Łukasiewicz Rules

Cites Work

• Unnamed Item
• Unnamed Item
• Complexity issues in Basic Logic
• Metamathematics of fuzzy logic
• Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers
• The Complexity of 3-Valued Łukasiewicz Rules

This page was built for publication: The Complexity of 3-Valued Łukasiewicz Rules