On the complexity of entailment in propositional multivalued logics

DOI10.1007/BF02136173zbMath0890.03010OpenAlexW2014806304MaRDI QIDQ1380415

Marco Cadoli, Marco Schaerf

Publication date: 22 April 1998

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02136173

zbMATH Keywords

algorithmscomplexity of entailment checkingcomputational aspects of multivalued logics

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Many-valued logic (03B50)

Related Items (10)

Tractable approximate deduction for OWL ⋮ The universe of propositional approximations ⋮ Semantic Restrictions over Second-Order Logic ⋮ Three-valued logics in modal logic ⋮ A first polynomial non-clausal class in many-valued logic ⋮ A complexity perspective on entailment of parameterized linear constraints ⋮ The Universe of Approximations ⋮ Approximate coherence-based reasoning ⋮ Autoreferential semantics for many-valued modal logics ⋮ The possibilistic Horn non-clausal knowledge bases

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A logic for reasoning with inconsistency
• A four-valued semantics for terminological logics
• Impossible possible worlds vindicated
• A decidable first-order logic for knowledge representation
• A kripke-kleene semantics for logic programs*
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• The well-founded semantics for general logic programs
• The complexity of theorem-proving procedures
• A nonstandard approach to the logical omniscience problem

This page was built for publication: On the complexity of entailment in propositional multivalued logics