Binary resolution over complete residuated Stone lattices

DOI10.1016/J.FSS.2007.10.001MaRDI QIDQ835103zbMATH OpenOpenAlexFDO

Authors Dušan Guller

Publication date 28 August 2009

Published in Fuzzy Sets and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.fss.2007.10.001

zbMATH Keywords

automated deductionmany-valued logicsknowledge representation and reasoningresolution proof methods

Mathematics Subject Classification ID

Knowledge representation (68T30) Many-valued logic (03B50) Mechanization of proofs and logical operations (03B35)

Recommendations

• Binary resolution over Boolean lattices
• On the refutational completeness of signed binary resolution and hyperresolution
• A resolution method for linguistic many-valued logic
• scientific article; zbMATH DE number 1829817
• Generalized resolution in Boolean operator fuzzy logic

Cites work

• scientific article; zbMATH DE number 1303351 (Why is no real title available?)
• A structure-preserving clause form translation
• An optimality result for clause form translation
• Binary resolution over Boolean lattices
• Short Conjunctive Normal Forms in Finitely Valued Logics

Cited in

(4)

• Determination of \(\alpha \)-resolution in lattice-valued first-order logic \(\mathrm{LF}(X)\)
• Binary resolution over Boolean lattices
• General form of \(\alpha\)-resolution principle for linguistic truth-valued lattice-valued logic
• On the refutational completeness of signed binary resolution and hyperresolution

This page was built for publication: Binary resolution over complete residuated Stone lattices

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