• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Liu Quan, Fu Yuchen, Sun Jigui, Cui Zhiming, Gong Shengrong, Ling Xinghong. An Automated Reasoning Expanded Method Based on Set Signs[J]. Journal of Computer Research and Development, 2007, 44(8): 1317-1323.
Citation: Liu Quan, Fu Yuchen, Sun Jigui, Cui Zhiming, Gong Shengrong, Ling Xinghong. An Automated Reasoning Expanded Method Based on Set Signs[J]. Journal of Computer Research and Development, 2007, 44(8): 1317-1323.

An Automated Reasoning Expanded Method Based on Set Signs

More Information
  • Published Date: August 14, 2007
  • 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-clssical 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.
  • Related Articles

    [1]Pang Tao, Duan Zhenhua. Symbolic Model Checking of WISHBONE on-Chip Bus[J]. Journal of Computer Research and Development, 2014, 51(12): 2759-2771. DOI: 10.7544/issn1000-1239.2014.20131164
    [2]Zhou Hang, Huang Zhiqiu, Zhu Yi, Xia Liang, Liu Linyuan. Real-Time Systems Contact Checking and Resolution Based on Time Petri Net[J]. Journal of Computer Research and Development, 2012, 49(2): 413-420.
    [3]Wang Yongji, Wu Jingzheng, Ding Liping, Zeng Haitao. Detecion Approach for Covert Channel Based on Concurrency Conflict Interval Time[J]. Journal of Computer Research and Development, 2011, 48(8): 1542-1553.
    [4]Liu Li, Chen Mingyu, Bao Yungang, Xu Jianwei, Fan Jianping. A Stream Checking and Prefetching Algorithm Based on Page Level Stream Buffer Architecture[J]. Journal of Computer Research and Development, 2009, 46(10): 1758-1767.
    [5]Jiang Hua, Li Xiang. Model Checking for Mobile Ambients[J]. Journal of Computer Research and Development, 2009, 46(10): 1750-1757.
    [6]Gong Rui, Chen Wei, Liu Fang, Dai Kui, and Wang Zhiying. Control Flow Checking and Recovering by Compiler Signatures and Hardware Checking[J]. Journal of Computer Research and Development, 2009, 46(2): 345-351.
    [7]Zhang Junhua, Huang Zhiqiu, and Cao Zining. Counterexample Generation for Probabilistic Timed Automata Model Checking[J]. Journal of Computer Research and Development, 2008, 45(10): 1638-1645.
    [8]Zhao Mingfeng, Song Wen, Yang Yixian. Confusion Detection Based on Petri-Net[J]. Journal of Computer Research and Development, 2008, 45(10): 1631-1637.
    [9]Huang Weiping. Program Restructuring to Improve Efficiency of Software Model Checking[J]. Journal of Computer Research and Development, 2008, 45(8): 1417-1422.
    [10]He Jian, Qin Zheng. Modeling and Checking the Behavior of Software Architecture[J]. Journal of Computer Research and Development, 2005, 42(11): 2018-2024.

Catalog

    Article views (815) PDF downloads (495) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return