Rangaswamy, SV and Chakrapani, N and Tikekar, VG (1980) A computational algorithm for the verification of tautologies in propositional calculus. In: Journal of Indian Institute of Science, 62 (A). pp. 71-81.
fulltext.pdf - Published Version
A computational algorithm (based on Smullyan's analytic tableau method) that varifies whether a given well-formed formula in propositional calculus is a tautology or not has been implemented on a DEC system 10. The stepwise refinement approch of program development used for this implementation forms the subject matter of this paper. The top-down design has resulted in a modular and reliable program package. This computational algoritlhm compares favourably with the algorithm based on the well-known resolution principle used in theorem provers.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Indian Institute of Science.|
|Keywords:||Tautology, propositional calculus, analytic tableau, topdown design, stcpwise refinement, fiscal .|
|Department/Centre:||Division of Physical & Mathematical Sciences > Mathematics|
|Date Deposited:||09 Jul 2009 07:02|
|Last Modified:||19 Sep 2010 05:36|
Actions (login required)