• Corpus ID: 8745302

Theorem Proving Based on Semantics of DNA Strand Graph

@article{Ray2017TheoremPB,
  title={Theorem Proving Based on Semantics of DNA Strand Graph},
  author={Kumar Sankar Ray and Mandrita Mondal},
  journal={ArXiv},
  year={2017},
  volume={abs/1702.05383}
}
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… 
1 Citations

Figures and Tables from this paper

DNA Tweezers Based on Semantics of DNA Strand Graph
TLDR
This paper enlightens the procedure to deduce a precise conclusion from a set of propositions by using formal language theory in form of process calculus and the expressive power of DNA strand graph.

References

SHOWING 1-10 OF 14 REFERENCES
DNA Implementation of Theorem Proving with Resolution Refutation in Propositional Logic
TLDR
It is shown that the resolution refutation proof procedure can be naturally and efficiently implemented by DNA hybridization, and the massive parallelism of molecular reactions is used to implement parallel theorem provers.
Logical Inference by DNA Strand Algebra
TLDR
The present approach to logical inference based on DNA strand algebra is basically an attempt to develop expert system design in the domain of DNA computing.
Symbolic logic and mechanical theorem proving
Similarity-based fuzzy reasoning by DNA computing
TLDR
A wet lab algorithm is proposed for applicable form of fuzzy reasoning by DNA computing with an aim to add a new dimension to the existing similarity-based fuzzy reasoning method by bringing it down to nanoscale computing.
Programmable and autonomous computing machine made of biomolecules
TLDR
A programmable finite automaton comprising DNA and DNA-manipulating enzymes that solves computational problems autonomously and has a transition fidelity greater than 99.8%.
Molecular computation of solutions to combinatorial problems.
TLDR
This experiment demonstrates the feasibility of carrying out computations at the molecular level by solving an instance of the directed Hamiltonian path problem with standard protocols and enzymes.
CLASSIFICATION OF SODAR DATA BY DNA COMPUTING
TLDR
A wet lab algorithm for classification of SODAR data by DNA computing is proposed, based on a new concept of similarity-based fuzzy reasoning suitable for wet lab implementation and a completely new measure of similarity based on base pair difference is developed.
Dynamic DNA nanotechnology using strand-displacement reactions.
TLDR
Here, this work reviews DNA strand-displacement-based devices, and looks at how this relatively simple mechanism can lead to a surprising diversity of dynamic behaviour.
DNA hairpins: fuel for autonomous DNA devices.
TLDR
A study of the hybridization of complementary DNA hairpin loops, with particular reference to their use as fuel for autonomous DNA devices, finds loop opening via an external toehold to be 10-100 times faster than via an internal toehold.
...
...