Simplification of many-valued logic formulas using anti-links

DOI10.1093/LOGCOM/8.4.569MaRDI QIDQ4209297zbMATH OpenOpenAlexFDO

Authors Bernhard Beckert, Reiner Hähnle, Gonzalo Escalada-Imaz

Publication date 2 March 1999

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://publikationen.bibliothek.kit.edu/14997

zbMATH Keywords

many-valued logicprime implicantsprime implicatessubsumption

Mathematics Subject Classification ID

Many-valued logic (03B50)

Recommendations

• The general expression of formulas in two-valued propositional logic F(S_n) in the meaning of logical equivalence
• scientific article; zbMATH DE number 3323814
• Short Conjunctive Normal Forms in Finitely Valued Logics
• Factor semantics for n-valued logics

Cited in

(3)

• The possibilistic Horn non-clausal knowledge bases
• The general expression of formulas in two-valued propositional logic F(S_n) in the meaning of logical equivalence
• A first polynomial non-clausal class in many-valued logic

This page was built for publication: Simplification of many-valued logic formulas using anti-links

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