Title: Computational complexity of infinite-valued Łukasiewicz propositional logic
Abstract: lt is shown for infinite-valued Lukasiewicz propositional logic that the consequence relation is complete for coNP and that the consequence problem is Π₂-complete. Using nondeterministic Turing-reduction to linear programming a simplified proof for the NP-completeness of the satisfiability problem is given.
Publication Year: 1998
Publication Date: 1998-04-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot