摘要
本文以文(1)为基础,继续讨论中介逻辑的自动推理理论。文中给出了中介谓词演算系统MF及MF,带等词的中介词演算系统ME及ME的表推演系统,通过对表推演概念的扩充,详细证明了MF的表推演系统的可靠性与完备性,同时给出了其定理自动证明的理论算法。
This article is the second of a series of articles discussing theoretical and implementational problems on automated reasoning in medium logic. Based on article [I], we present tableau systems of medium predicate calculus MF and MF*, and medium predicate calculus with equality ME and ME*. We prove soundness and completeness of the tableau system of MF* in detail and give an theoretical algorithm of automated theorem proving for them.
出处
《模式识别与人工智能》
EI
CSCD
北大核心
1994年第3期175-180,共6页
Pattern Recognition and Artificial Intelligence
基金
国家高技术研究发展计划资助项目(863-306-05-16B
关键词
中介逻辑
自动推理
表推演系统
Automated Theorem Proving
Medium Logic
Tableau Method.