首页> 外文期刊>The international journal for technology in mathematics education >Teaching Semantic Tableaux Method for Propositional Classical Logic with a CAS
【24h】

Teaching Semantic Tableaux Method for Propositional Classical Logic with a CAS

机译:用CAS教授命题经典逻辑的语义表方法。

获取原文
获取原文并翻译 | 示例
       

摘要

Automated theorem proving (ATP) for Propositional Classical Logic is an algorithm to check the validity of a formula. It is a very well-known problem which is decidable but co-NP-complete. There are many algorithms for this problem. In this paper, an educationally oriented implementation of Semantic Tableaux method is described. The program has been designed to be used as a pedagogical tool to help in the teaching and learning process of the subject Propositional Classical Logic. Therefore, the main goal of the implementation is not to be very efficient but to get a useful tool for education. For this reason, the implementation of the Semantic Tableaux method provides an optional graphical approach which shows, step by step, the trace of the algorithm when applied to a specific problem. The algorithm has been implemented using a CAS (Computer Algebra System), specifically DERIVE, as part of the students training in Mathematics for Engineering. The result is a utility file containing a didactical implementation of the Semantic Tableaux algorithm which can be used not only at lectures but as a self-learning tool by students. With this utility file, students can check the results obtained by hand and, in case they get a wrong result, students can find the step where the mistake occurred. Furthermore, if the student does not know how to solve an exercise, the utility file can show how to overcome this situation step by step. Since Derive does not have the Semantic Tableauxs algorithm implemented, this utility file increases the capabilities of this CAS. Therefore, Derive can act as an automated theorem prover for Propositional Classical Logic from a PeCAS (Pedagogical CAS) point of view. The description of how to use this utility file will be shown throughout different examples related to validity, satisfability and deduction, which are the main kind of problems that an ATP can solve. Finally, since the Semantic Tableaux algorithm uses a tree structure, another utility file has been developed to deal with trees. In this paper, this utility file is also described.
机译:命题经典逻辑的自动定理证明(ATP)是一种检查公式有效性的算法。这是一个非常著名的问题,可以确定,但可以同时完成NP。有很多算法可以解决这个问题。在本文中,描述了一种以教育为导向的语义表方法的实现。该程序旨在用作教学工具,以帮助命题古典逻辑的教与学过程。因此,实施的主要目标不是非常有效,而是要获得有用的教育工具。因此,语义表方法的实现提供了一种可选的图形方法,该方法逐步显示了应用于特定问题时算法的轨迹。该算法是使用CAS(计算机代数系统),特别是DERIVE实施的,这是对工程数学的学生进行培训的一部分。结果是一个实用文件,其中包含语义Tableaux算法的教学实现,该算法不仅可以用于授课,还可以用作学生的自学工具。使用此实用程序文件,学生可以检查手工获得的结果,如果发现错误的结果,学生可以找到发生错误的步骤。此外,如果学生不知道如何解决练习,实用程序文件可以逐步显示如何克服这种情况。由于Derive没有实现语义表算法,因此该实用程序文件增加了该CAS的功能。因此,从PeCAS(教学CAS)的角度来看,Derive可以充当命题古典逻辑的自动定理证明者。贯穿各个与有效性,可满足性和推论有关的示例,将介绍如何使用此实用程序文件,这是ATP可以解决的主要问题。最后,由于语义Tableaux算法使用树结构,因此开发了另一个实用程序文件来处理树。在本文中,还描述了该实用程序文件。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号