On the basis of the many-valued logics tableau reasoning, an automated reasoning expansion method based on set sign is presented. This approach which treats set signs as truth values can be applied to some methods and...
详细信息
On the basis of the many-valued logics tableau reasoning, an automated reasoning expansion method based on set sign is presented. This approach which treats set signs as truth values can be applied to some methods and techniques of reasoning suited to classical logics, which make reasoning reform from the non-classical logics to the classical logics. Through rewriting set signs and expansion rules, it is very easy to spread to modal logics, intuitionistic logics and so on. The technology can also be further spread to infinite-valued logic and logic with fuzzy quantifiers (such as T-calculus and S-calculus and so on). The theorem proving system-TSetTAP is implemented by using SWI-PROLOG language in microcomputer. Using method of set signs in the system, rule programming can be generated by only increasing reasoning rules in rule base. System need not be repaired. So some strategies and approaches used in classical logics can easily apply to non-classical logic. 900 logic questions in TPTP are proved using the system. The result shows TSetTAP makes the tableau close early and improve greatly in time efficiency and space efficiency of reasoning.
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 *** number of branches increases in exponent with the in...
详细信息
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 *** 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 *** 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.
暂无评论