메뉴 건너뛰기




Volumn , Issue , 2003, Pages 818-823

Checking satisfiability of a conjunction of BDDs

Author keywords

BDD; Satisfiability

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY;

EID: 0043136488     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/776038.776039     Document Type: Conference Paper
Times cited : (19)

References (11)
  • 2
    • 0042192062 scopus 로고    scopus 로고
    • A. Biere. www.inf.ethz.ch/personal/biere/projects/limmat/.
    • Biere, A.1
  • 3
    • 0022769976 scopus 로고
    • Graph-based algorithms for boolean function manipulation
    • August
    • R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, August 1986.
    • (1986) IEEE Transactions on Computers , vol.C-35 , Issue.8 , pp. 677-691
    • Bryant, R.E.1
  • 6
    • 0031700823 scopus 로고    scopus 로고
    • Integrating a boolean satisfiability checker and bdds for combinational equivalence checking
    • A. Gupta and P. Ashar. Integrating a Boolean satisfiability checker and bdds for combinational equivalence checking. In Proc. Int'l Conf. on VLSI Design, pages 222-225, 1997.
    • (1997) Proc. Int'l Conf. on VLSI Design , pp. 222-225
    • Gupta, A.1    Ashar, P.2
  • 9
    • 0028743150 scopus 로고
    • Functional learning: A new approach to learning in digital circuits
    • R. Mukherjee, J. Jain, and D. Pradhan. Functional learning: A new approach to learning in digital circuits. In Proc. VLSI Test Symposium, pages 122-127, 1994.
    • (1994) Proc. VLSI Test Symposium , pp. 122-127
    • Mukherjee, R.1    Jain, J.2    Pradhan, D.3
  • 10
    • 0033714065 scopus 로고    scopus 로고
    • Equivalence checking combining a structural sat-solver, bdds, and simulation
    • V. Paruthi and A. Kuehlmann. Equivalence checking combining a structural sat-solver, bdds, and simulation. In Proc. Intl. Conf. on Computer Design, pages 459-464, 2000.
    • (2000) Proc. Intl. Conf. on Computer Design , pp. 459-464
    • Paruthi, V.1    Kuehlmann, A.2


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