메뉴 건너뛰기




Volumn 2568, Issue , 2003, Pages 156-167

DNA implementation of theorem proving with resolution refutation in prepositional logic

Author keywords

[No Author keywords available]

Indexed keywords


EID: 21844468069     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36440-4_14     Document Type: Article
Times cited : (12)

References (18)
  • 1
    • 0028114541 scopus 로고
    • Molecular computation of solutions to combinatorial problems
    • Adleman, L., Molecular computation of solutions to combinatorial problems, Science, 266:1021-1024, 1994.
    • (1994) Science , vol.266 , pp. 1021-1024
    • Adleman, L.1
  • 7
    • 0029278612 scopus 로고
    • DNA solution of hard computational problem
    • Lipton, R.J., DNA solution of hard computational problem, Science, 268:542-545, 1995.
    • (1995) Science , vol.268 , pp. 542-545
    • Lipton, R.J.1
  • 15
    • 0031109355 scopus 로고    scopus 로고
    • SPTHEO - A parallel theorem prover
    • Suttner, C., SPTHEO - A parallel theorem prover, Journal of Automated Reasoning, 18(2):253-258, 1997.
    • (1997) Journal of Automated Reasoning , vol.18 , Issue.2 , pp. 253-258
    • Suttner, C.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.