Year: 2017
Type: preprint
Abstract: 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.
Source: arXiv (Cornell University)
Authors: Ray, Kumar S., Mondal, Mandrita
Institution: Indian Statistical Institute
Language: English
Topic: DNA and Biological Computing
Subfield: Molecular Biology
Domain: Life Sciences
Open Access status: green
OpenAlex ID: W2592361810