Theorem Proving Based on Semantics of DNA Strand Graph
This work addresses a niche problem in DNA computing for automated theorem proving, but it appears incremental as it applies existing methods to a new domain without claiming broad advancements.
The paper tackles the problem of representing theorem proving with resolution refutation using DNA computation by modeling it through the semantics of process calculus and strand graphs, without providing concrete numerical results.
Because of several technological limitations of traditional silicon based computing, for past few years a paradigm shift, from silicon to carbon, is occurring in computational world. DNA computing has been considered to be quite promising in solving computational and reasoning problems by using DNA strands. Resolution, an important aspect of automated theorem proving and mathematical logic, is a rule of inference which leads to proof by contradiction technique for sentences in propositional logic and first-order logic. This can also be called refutation theorem-proving. In this paper we have shown how the theorem proving with resolution refutation by DNA computation can be represented by the semantics of process calculus and strand graph.