Binary resolution over Boolean lattices

DOI10.1016/J.FSS.2006.02.010zbMATH Open1117.03019OpenAlexW2000732792MaRDI QIDQ853473FDOQ853473

Dušan Guller

Publication date: 15 November 2006

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

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

Recommendations

• Binary resolution over complete residuated Stone lattices
• On the refutational completeness of signed binary resolution and hyperresolution
• scientific article; zbMATH DE number 1324434
• \(\alpha\)-resolution principle based on lattice-valued propositional logic \(\text{LP} (X)\)
• Graded many-valued resolution with aggregation.

zbMATH Keywords

automated deductionmany-valued logicsknowledge representationresolution proof systems

Mathematics Subject Classification ID

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

Cites Work

• Paraconsistent logic programming
• On Fuzzy Logic I Many‐valued rules of inference
• Fuzzy logic and approximate reasoning
• Metamathematics of fuzzy logic
• A lattice-theoretical fixpoint theorem and its applications
• Resolution theorem proving
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The SAT problem of signed CNF formulas
• Title not available (Why is that?)
• Commodious axiomatization of quantifiers in multiple-valued logic
• Resolution-based theorem proving for many-valued logics
• Title not available (Why is that?)
• Title not available (Why is that?)
• A logic for reasoning with inconsistency
• A framework for automated reasoning in multiple-valued logics
• Innovations in intelligent systems.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Short Conjunctive Normal Forms in Finitely Valued Logics
• Resolution-based decision procedures for the universal theory of some classes of distributive lattices with operators
• Optimal axiomatizations of finitely valued logics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimal axiomatizations for multiple-valued operators and quantifiers based on semi-lattices

Cited In (4)

• On the refutational completeness of signed binary resolution and hyperresolution
• Binary resolution over complete residuated Stone lattices
• Sparse Boolean equations and circuit lattices
• Determination of \(\alpha \)-resolution in lattice-valued first-order logic \(\mathrm{LF}(X)\)

This page was built for publication: Binary resolution over Boolean lattices

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