On the complexity of entailment in propositional multivalued logics

DOI10.1007/BF02136173zbMATH Open0890.03010OpenAlexW2014806304MaRDI QIDQ1380415FDOQ1380415

Authors: 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

Recommendations

• scientific article; zbMATH DE number 2042617
• scientific article; zbMATH DE number 1076962
• Many-valued computational logics
• scientific article; zbMATH DE number 910747

zbMATH Keywords

algorithmscomplexity of entailment checkingcomputational aspects of multivalued logics

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (13)

• Approximate coherence-based reasoning
• The possibilistic Horn non-clausal knowledge bases
• How to tell easy from hard: complexities of conjunctive query entailment in extensions of \(\mathcal{ALC}\)
• Tractable approximate deduction for OWL
• Autoreferential semantics for many-valued modal logics
• Entailment multipliers: an algebraic characterization of validity for classical and modal logics
• The universe of approximations
• A complexity perspective on entailment of parameterized linear constraints
• The universe of propositional approximations
• Semantic restrictions over second-order logic
• A first polynomial non-clausal class in many-valued logic
• Proof search and co-NP completeness for many-valued logics
• Three-valued logics in modal logic

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

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