经典命题表在程序设计前提下的表示
Presentation of Classical Propositional Tableaux on Program Design Premises
摘要:
我们提出了一个介绍经典的命题tableaux阐述的方法,值得注意的是在程序设计中的应用,即程序推导与分离的关注。我们首先从一个简单的规范推导出一个算法,作为一组递归方程来计算一组有限公式的所有模型。此后,我们讨论就业的数据结构,主要是关于一个容易追踪的手动执行的算法。这导致了通常作为构成场景的树木的种类。整个发展努力避免逻辑和动机上的差距。
英文摘要:
We propose a presentation of classical propositional tableaux elaborated by application of methods that are noteworthy in program design, namely program derivation with separation of concerns. We start by deriving from a straightforward specification an algorithm given as a set of recursive equations for computing all models of a finite set of formulae. Thereafter we discuss the employment of data structures, mainly with regard to an easily traceable manual execution of the algorithm. This leads to the kinds of trees given usually as constituting the tableaux. The whole development strives at avoiding gaps, both of logical and motivational nature.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。