Binary resolution over Boolean lattices (Q853473)

From MaRDI portal
Revision as of 22:12, 24 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Binary resolution over Boolean lattices
scientific article

    Statements

    Binary resolution over Boolean lattices (English)
    0 references
    0 references
    15 November 2006
    0 references
    The author presents a binary resolution system over complete Boolean lattices with the condition that their supremum operators are infinitely distributive over the infimum ones. He utilizes inference techniques developed in classical two-valued logic for many-valued ones. He considers many-valued logics \({\mathbf L}\) whose truth values form a Boolean algebra. He avoids any limitation to the finite case where the set of truth values or a given set of clauses are finite. The refutational soundness and completeness of binary \({\mathbf L}\)-resolution is proved.
    0 references
    many-valued logics
    0 references
    resolution proof systems
    0 references
    automated deduction
    0 references
    knowledge representation
    0 references
    0 references

    Identifiers