scientific article; zbMATH DE number 1076963

MaRDI QIDQ4360107zbMATH OpenFDO

Authors Gabriel Aguilera-Venegas, I. P. de Guzmán, Manuel Ojeda-Aciego

Publication date 25 November 1997

Full work available at URL https://eudml.org/doc/39103

zbMATH Keywords

algorithmŁukasiewicz logicmany-valued theorem provingpropositional three-valued logic

Mathematics Subject Classification ID

Many-valued logic (03B50) Mechanization of proofs and logical operations (03B35)

Recommendations

• scientific article; zbMATH DE number 4049622
• Resolution-based theorem proving for many-valued logics
• scientific article; zbMATH DE number 1754535
• Automated theorem proving for Łukasiewicz logics

Cited in

(8)

• A temporal negative normal form which preserves implicants and implicates
• TMPR: A tree-structured modified problem reduction proof procedure and its extension to three-valued logic
• Short Conjunctive Normal Forms in Finitely Valued Logics
• A first polynomial non-clausal class in many-valued logic
• The possibilistic Horn non-clausal knowledge bases
• A Three-valued Formalization of Provability
• Reductions for non-clausal theorem proving
• R-Calculus, III: Post Three-Valued Logic

This page was built for publication:

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