期刊文献+

基于Tableau的定理机器证明系统TableauTAP 被引量:3

Theorem Proving System Based on Tableau——TableauTAP
下载PDF
导出
摘要 使用SWI-PROLOG语言在微机上设计实现了基于tableau的定理证明系统TableauTAP。该系统可以证明不含等词的经典逻辑公式和多值逻辑公式,通过预处理自动生成tableau规则,因此容易对其功能进行扩展。应用该系统对TPTP的400个逻辑问题进行证明,实验结果表明,TableauTAP在时间和空间效率上都是比较高的。 Theorem proving system is implemented by using SWI-PROLOG language in microcomputer and proved its sound. This system can prove classical logics and many-valued logics formulae without equality. It is very easy to extend its function due to tableau rules are produced automatically by preprocessing. 400 logic questions in TPTP are proved using the system that. The result shows that TableauTAP makes the tableau close early and improves greatly in time efficiency and space efficiency of deduction.
作者 刘全 孙吉贵
出处 《计算机工程》 EI CAS CSCD 北大核心 2006年第7期38-39,45,共3页 Computer Engineering
基金 国家自然科学基金资助项目(60073039 60273080) 吉林省科技发展计划基金资助项目(20020306) 吉林大学创新基金资助项目
关键词 TABLEAU 定理机器证明 TableauTAP系统 Tableau Theory machine proving TableauTAP system
  • 相关文献

参考文献6

二级参考文献41

  • 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

同被引文献19

  • 1刘全,孙吉贵,于万钧.自由变量语义tableau中δ-规则的一种改进方法[J].计算机研究与发展,2004,41(7):1068-1073. 被引量:8
  • 2刘全,孙吉贵.基于语义tableau的一阶逻辑自动定理证明[J].计算机工程与应用,2005,41(23):22-24. 被引量:3
  • 3Melvin Fitting. First-Order Logic and Automated Theorem Proving [ M]. New York :Springer Verlag, 1996.
  • 4Melvin Fitting. Types and Tableau [ M ]. New York:Springer Verlag,2000.
  • 5B Beckert. Depth-first proof search without backtracking for free variable clause tableaux [ J ]. Journal of Symbolic Computation 2002,75(5) :120 - 138.
  • 6L Bertossi,C Schwind.Analytic tableaux and database repairs[G].In:Foundations of Information and Knowledge Systems,LNCS 2284.Berlin:Springer,2002.
  • 7R Zabel.Proof theory of finity-valued logics:[Ph D disertation][D].TU Wien:Institut für Algebra und Diskrete Mathematic,1993.
  • 8R H(a)hnle.Complexity of many-valued logics[G].In:Beyond Two:Theory and Application of Many-Valued Logic.GmbH Hebh,Germany:Physica-Verlag,2003.211-233.
  • 9R H(a)hnle.Commodious axiomatization of quantifiers in many-values logic[J].Strudia Logical,1998,61(1):101-121.
  • 10M Baaz,R Zach.Integer programming in finite-valued logics[G].In:Logics in Artifical Intelligence,Proc of JELIA'2004,LNAI 3229.Berlin:Springer,2004.128-154.

引证文献3

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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