The Experts below are selected from a list of 2286 Experts worldwide ranked by ideXlab platform

Ji-gui Sun - One of the best experts on this subject based on the ideXlab platform.

  • A Boolean Pruning Method for Improving Tableau Reasoning Efficiency in First-Order Multiple-Valued Logics
    2006 International Conference on Machine Learning and Cybernetics, 2006
    Co-Authors: Quan Liu, Zhi-ming Cui, Ji-gui Sun
    Abstract:

    Tableau method with quantifiers in first-order multiple-valued logic has uniform rules of extension, and sound and completeness have been proved by Zabel and so on. The number of branches increases in exponent with the increasing of truth-value, which will affect the performance efficiency of machine. A Boolean pruning method is proposed in this paper, which simplified the extended rules of logic Formula with quantifiers in first-order multiple-valued greatly by linking the Signed Formula and upper/lower bound of set. In addition, through the analyzing of Boolean pruning method, simplified tableau reasoning method for a kind of special regular logic Formulae in first-order multiple-valued was founded, which made logic tableau reasoning method with quantifiers in first-order multiple-valued is similar to classical logic tableau method

Quan Liu - One of the best experts on this subject based on the ideXlab platform.

  • A Boolean Pruning Method for Improving Tableau Reasoning Efficiency in First-Order Multiple-Valued Logics
    2006 International Conference on Machine Learning and Cybernetics, 2006
    Co-Authors: Quan Liu, Zhi-ming Cui, Ji-gui Sun
    Abstract:

    Tableau method with quantifiers in first-order multiple-valued logic has uniform rules of extension, and sound and completeness have been proved by Zabel and so on. The number of branches increases in exponent with the increasing of truth-value, which will affect the performance efficiency of machine. A Boolean pruning method is proposed in this paper, which simplified the extended rules of logic Formula with quantifiers in first-order multiple-valued greatly by linking the Signed Formula and upper/lower bound of set. In addition, through the analyzing of Boolean pruning method, simplified tableau reasoning method for a kind of special regular logic Formulae in first-order multiple-valued was founded, which made logic tableau reasoning method with quantifiers in first-order multiple-valued is similar to classical logic tableau method

Zhi-ming Cui - One of the best experts on this subject based on the ideXlab platform.

  • A Boolean Pruning Method for Improving Tableau Reasoning Efficiency in First-Order Multiple-Valued Logics
    2006 International Conference on Machine Learning and Cybernetics, 2006
    Co-Authors: Quan Liu, Zhi-ming Cui, Ji-gui Sun
    Abstract:

    Tableau method with quantifiers in first-order multiple-valued logic has uniform rules of extension, and sound and completeness have been proved by Zabel and so on. The number of branches increases in exponent with the increasing of truth-value, which will affect the performance efficiency of machine. A Boolean pruning method is proposed in this paper, which simplified the extended rules of logic Formula with quantifiers in first-order multiple-valued greatly by linking the Signed Formula and upper/lower bound of set. In addition, through the analyzing of Boolean pruning method, simplified tableau reasoning method for a kind of special regular logic Formulae in first-order multiple-valued was founded, which made logic tableau reasoning method with quantifiers in first-order multiple-valued is similar to classical logic tableau method