期刊文献+

基于语义tableau的一阶逻辑自动定理证明 被引量:3

Automated Theorem Proving Based on Semantic Tableau in First-Order Logic
在线阅读 下载PDF
导出
摘要 自动推理作为自动定理证明的扩展是人工智能研究的基础工作,许多重要的人工智能系统都是以推理系统为其核心部分,其中的tableau方法,由于具有通用性、直观性及易于计算机实现等特点,至今成为重要的自动推理方法之一。在tableau方法基础上,讨论了一阶逻辑中的自动定理证明理论,提出使用模型存在定理证明其可靠性和完备性的方法。同时也给出了带等词tableau方法的证明过程。 Automated deduction which is extension to automated theorem proving is a basic work of artificial intelligence.Many important systems of artificial intelligence regard deduction system as core part,Today tableau method has become one of the main deductions,because it is universal and intuitionistic,and easy to be implemented. Based on tableau the theories of automated theorem proving in first-order logic are discussed.For proving the soundness and the completeness,the methods of theorem proving using the model existence theorem are presented.In the mean time,this paper shows proof procedure of tableau with equality。
作者 刘全 孙吉贵
出处 《计算机工程与应用》 CSCD 北大核心 2005年第23期22-24,共3页 Computer Engineering and Applications
基金 国家自然科学基金(编号:60273080 60473003)资助
关键词 语义tableau 有效性 完备性 semantic tableau, soundness, completeness
  • 相关文献

参考文献6

二级参考文献39

  • 1孙吉贵,刘叙华.表推演方法[J].计算机科学,1995,22(6):45-48. 被引量:2
  • 2Bessonet C G. A Many-Valued Approach to Deduction and Reasoning for Artifical Inteligence. Boston: Kluwer Academic Publishers, 1991.
  • 3Hgthnle R, Kernig W. Verification of switch level designs with many-valued logic. In: Proceedings of LPAR' 93, St. Petersburg, Russia, 1993. 158-169.
  • 4Kerber M, Kohlhase M. A Tableau calculus for partial functions. In: Collegium Logicum. Annals of the Kurt-Godel-Society. New York: Springer-Verlag, 1996. 21-49.
  • 5Bonissone P P. Soft computing: the convergence of emerging reasoning technologies. Soft Computing A Fusion of Foundations, Met hodologies and Applications, 1997,1 ( 1 ) : 6- 18.
  • 6Pearl J. Probabilistic Reasoning in Intelligent System:Networks of Plausible Inference. Revise Second Edition. Morgan Kaufmann,1994.
  • 7Messing B. Combining knowledge with many-valued Logies. In:Data Knowledge Engineering. Boston: Kluwer Aeademie Publishers,1997.
  • 8Zabel R. Proof theory of finity-valued logics [Ph D dissertationS. Institut far Algebra und Diskrete Mathematic,TU Wien,1993.
  • 9Hfihnle R. Uniform notation of Tableaux rules for multiple-valued logics. In: Proceedings of International Symposium on Multiple-Valued Logic, Los Alamitos, 1991. 238- 245.
  • 10Haihnle R. Automated Deduction in Multiple-Valued Logics.Britain:Oxford University Press,1994.

共引文献15

同被引文献22

引证文献3

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部