—Automated Theorem Proving systems are enormously powerful computer programs capable of solving immensely difficult problems. The extreme capabilities of these systems lie on some well-established proof systems, such as Semantic tableau. It is used to prove the validity of a formula by contradiction and it can produce a counterexample if it fails. It can also be used to prove whether a formula is a logical consequence of a set of formulas. Tableau can be used in propositional logic, predicate logic, modal logic, temporal logic, and in other non-classical logics. In this article, we describe a detailed implementation of a sequential tableau algorithm for propositional and firstorder logic using a procedural language rather then logic programming language. We also illustrate a tableau based proof system in a distributed environment using the Message Passing Interface. This paper also investigates two distinct approaches for parallel and distributed implementation and describes the experimental formula generation procedure. The proposed high performance approach will un-wrap an efficient paradigm for automated theorem proving.
展开▼
