메뉴 건너뛰기




Volumn 3569, Issue , 2005, Pages 482-489

On subsumption removal and on-the-fly CNF simplification

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS;

EID: 26444481567     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11499107_42     Document Type: Conference Paper
Times cited : (39)

References (12)
  • 1
    • 0032680865 scopus 로고    scopus 로고
    • GRASP: A search algorithm for propositional satisfiability
    • João P. Marques-Silva and Karem A. Sakallah, "GRASP: A Search Algorithm for Propositional Satisfiability, In IEEE Tran. on Computers, vol. 48, 506-521, 1999
    • (1999) IEEE Tran. on Computers , vol.48 , pp. 506-521
    • Marques-Silva, J.P.1    Sakallah, K.A.2
  • 3
    • 84881072062 scopus 로고
    • A computing procedure for quantification theory
    • M. Davis and H. Putnam, A computing procedure for quantification theory, Journal of the ACM, vol. 7, pp. 201-215, 1960.
    • (1960) Journal of the ACM , vol.7 , pp. 201-215
    • Davis, M.1    Putnam, H.2
  • 9
    • 0027211369 scopus 로고
    • Zero-suppressed BDDs for set manipulation in combinatorial problems
    • S. Minato, "Zero-Suppressed BDDs for Set Manipula-tion in Combinatorial Problems," in Proc. of the Design Automation Conference (DAC93), pp. 272-277, 1993
    • (1993) Proc. of the Design Automation Conference (DAC93) , pp. 272-277
    • Minato, S.1


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