期刊文献+

改进γ公式的表推演推理方法研究

Tableau Reasoning Method with an Improved γ Formulae
下载PDF
导出
摘要 表推演方法是一种接近于逻辑系统表示的自动推理方法,由于其直观性和通用性,易于计算机实现,因此成为目前最普及的自动推理方法之一。在表推演实现时,对γ规则应用次数的限制至关重要,限制次数直接影响表推演的推理效率。给出识别γ公式方法,提出了含γ公式的表推演推理的改进策略,并进行了理论证明和系统实现,该系统与leanTAP软件包进行了对比实验。通过对Pelletier问题的20个实例分析,可以看出γ公式不再需要实例化,大大缩短了表推演的证明过程,减少了搜索空间,提高了推理效率。 Tableau is an automated reasoning method which is closed with Logic system.In implementing tableau it is very important for us to limit the number of γ-rule applications. The number that γ-rule applications affect directly efficiency of tableau reasoning. This paper presents a method for recognizing γ formulae and introduces an improved algorithm for tableau with γ formulae. The system :UniTAP by PROLOG is implemented. Experimental comparisons have been done between UniTAP and leanTAP software package,which is a complete and sound theorem prover for classical first-order logic based on free variable tableaux. By the analyses of 20 of Pelletier's problems, the results show that the instantiations of γ formulae are not taken into consideration. This can be beneficial to yield shorter tableau proofs, and in most cases reduced the search space.
出处 《计算机应用研究》 CSCD 北大核心 2005年第1期41-43,46,共4页 Application Research of Computers
基金 国家自然科学基金资助项目(600703039) 教育部骨干教师基金资助项目 吉林省自然科学基金资助项目(2000540)
关键词 γ公式 表推演 实现 γ Formulae Tableau Implementation
  • 相关文献

参考文献14

  • 1Raymond Smullyan. First-order Logic [ M]. Springer Verlag, Berlin,1968 ;Revised Edition, Dover Press, New York, 1994.
  • 2M C Fitting. First-order Logic and Automated Theorem Proving[ M].Springer Verlag, 1996.
  • 3M C Fitting. Types and Tableau[ M]. Springer Verlag,Berlin,2000.
  • 4F J Pelletier. Seventy-five Problems for Testing Automatic Theorem Provers[ J ]. Journal of Automated Reasoning, 1988, (4) :69-100.
  • 5B Beckert. Depth-first Proof Search without Backtracking for Freevariable Clause Tableaux[ J ]. Journal of Symbolic Computation ,2002 ,(5) :120-138.
  • 6B Beckerl, J Posegga. LeanTAP: Lean Tableau-based Deduction[ J ].Journal of Automated Reasoning, 1995,15 ( 3 ) :339-358.
  • 7B Beckerl, et al. Transformations Between Signed and Classical Clause Logic[ C]. Proc of ISMVL 99, IEEE Press, 1999. 248-255.
  • 8Raymond Smullyan.First-order Logic[M].Springer Verlag, Berlin,1968;Revised Edition, Dover Press, New York, 1994.
  • 9M C Fitting.First-order Logic and Automated Theorem Proving[M]. Springer Verlag, 1996.
  • 10M C Fitting.Types and Tableau[M].Springer Verlag,Berlin,2000.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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