DNA Implementation of Theorem Proving with Resolution Refutation in Propositional Logic

Authors:
In-Hee Lee;Ji-Yoon Park;Hae-Man Jang;Young-Gyu Chai;Byoung-Tak Zhang
Affiliations:
-;-;-;-;-
Venue:
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Year:
2002

Citing 7
Cited 0

Artificial intelligence (2nd ed.): structures and strategies for complex problem-solving

Artificial intelligence (2nd ed.): structures and strategies for complex problem-solving
Molecular computation of solutions to combinatorial problems

Science
Artificial intelligence: a new synthesis

Artificial intelligence: a new synthesis
SPTHEO - A Parallel Theorem Prover

Journal of Automated Reasoning
Horn Clause Computation by Self-assembly of DNA Molecules

DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Self-assembling DNA Graphs

DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Algorithmic self-assembly of dna

Algorithmic self-assembly of dna

Quantified Score

Hi-index	0.00

Visualization

Abstract

Theorem proving is a classical AI problem having a broad range of applications. Since its complexity grows exponentially with the size of the problem, many researchers have proposed methods to parallelize the theorem proving process. Here, we use the massive parallelism of molecular reactions to implement parallel theorem provers. In particular, we show that the resolution refutation proof procedure can be naturally and efficiently implemented by DNA hybridization. Novel DNA encoding schemes, i.e. linear encoding and hairpin encoding, are presented and their effectiveness is verified by biochemical experiments.