메뉴 건너뛰기




Volumn 02-February-1998, Issue , 1998, Pages 23-28

Parallel genetic algorithm to solve the satisfiability problem

Author keywords

David Putnam method; Genetic algorithms; Model generation; Parallel processing; Satisfiability problem

Indexed keywords

COMPUTATION THEORY; EMBEDDED SYSTEMS; FORMAL LOGIC; GENETIC ALGORITHMS;

EID: 85002263500     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/330560.330565     Document Type: Conference Paper
Times cited : (8)

References (8)
  • 1
    • 0025554975 scopus 로고
    • Theorem proving in prepositional logic on vector computers using a generalized davis-putnam procedure
    • Chen, W. and Fang, M. Theorem Proving in Prepositional Logic on Vector Computers Using a Generalized Davis-Putnam Procedure. Proceedings of Supercomputing 1990, pp. 658-665, 1990.
    • (1990) Proceedings of Supercomputing , vol.1990 , pp. 658-665
    • Chen, W.1    Fang, M.2
  • 4
    • 0000427802 scopus 로고
    • Branching rules for satisfiability
    • Hooker, J. N. and Vinay, V. Branching Rules for Satisfiability. Journal of Automated Reasoning, Vol. 15, No. 3, pp. 359-383, 1995.
    • (1995) Journal of Automated Reasoning , vol.15 , Issue.3 , pp. 359-383
    • Hooker, J.N.1    Vinay, V.2


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