DNA implementation of theorem proving with resolution refutation in propositional logic
- Title
- DNA implementation of theorem proving with resolution refutation in propositional logic
- Author
- 채영규
- Keywords
- Polymerase Chain Reaction Condition; Boolean Variable; Empty Clause; Goal Variable; Polymerase Chain Reaction Step
- Issue Date
- 2002-06
- Publisher
- Springer
- Citation
- DNA Computing. Lecture Notes in Computer Science, v. 2568, page. 156-167
- Abstract
- 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 esearchers have proposed methods to par-
allelize the theorem proving process.In this paper,we use the massive
parallelism of molecular reactions to implement parallel theorem provers.
In particular,we show that the resolution efutation proof procedure can
be naturally and e ciently implemented by DNA hybridization.Novel
DNA encoding schemes,i.e.linear encoding and hairpin encoding,are
presented and their e ectiveness is veri ed by bio-lab experiments.
- URI
- https://link.springer.com/chapter/10.1007/3-540-36440-4_14https://repository.hanyang.ac.kr/handle/20.500.11754/157006
- ISBN
- 978-3-540-00531-5; 978-3-540-36440-5
- DOI
- 10.1007/3-540-36440-4_14
- Appears in Collections:
- COLLEGE OF SCIENCE AND CONVERGENCE TECHNOLOGY[E](과학기술융합대학) > MOLECULAR AND LIFE SCIENCE(분자생명과학과) > Articles
- Files in This Item:
There are no files associated with this item.
- Export
- RIS (EndNote)
- XLS (Excel)
- XML