On the complexity of entailment in propositional multivalued logics

DOI10.1007/BF02136173MaRDI QIDQ1380415zbMATH OpenOpenAlexFDO

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

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)

Recommendations

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

Cites work

• scientific article; zbMATH DE number 4174350 (Why is no real title available?)
• scientific article; zbMATH DE number 15392 (Why is no real title available?)
• scientific article; zbMATH DE number 3504935 (Why is no real title available?)
• scientific article; zbMATH DE number 3635458 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 611096 (Why is no real title available?)
• scientific article; zbMATH DE number 1142303 (Why is no real title available?)
• A decidable first-order logic for knowledge representation
• A four-valued semantics for terminological logics
• A kripke-kleene semantics for logic programs*
• A logic for reasoning with inconsistency
• A nonstandard approach to the logical omniscience problem
• Impossible possible worlds vindicated
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• The complexity of theorem-proving procedures
• The well-founded semantics for general logic programs

Cited in

(13)

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

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)