메뉴 건너뛰기




Volumn 2309, Issue , 2002, Pages 57-71

Heuristics for efficient manipulation of composite constraints

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; ITERATIVE METHODS;

EID: 0013091845     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-45988-x_6     Document Type: Article
Times cited : (5)

References (19)
  • 1
    • 85018991901 scopus 로고    scopus 로고
    • CUDD: CU decision diagram package, http://vlsi.colorado.edu/˜fabio/CUDD/.
  • 2
    • 85018984309 scopus 로고    scopus 로고
    • The Omega project, http://www.cs.umd.edu/projects/omega/.
  • 5
    • 0022769976 scopus 로고
    • Graph-based algorithms for boolean function manipulation
    • R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, 35(8):677-691, 1986.
    • (1986) IEEE Transactions on Computers , vol.35 , Issue.8 , pp. 677-691
    • Bryant, R.E.1
  • 7
    • 0012085727 scopus 로고    scopus 로고
    • Model-checking concurrent systems with unbounded integer variables: Symbolic representations, approximations, and experimental results
    • July
    • T. Bultan, R. Gerber, and W. Pugh. Model-checking concurrent systems with unbounded integer variables: Symbolic representations, approximations, and experimental results. ACM Transactions on Programming Languages and Systems, 21(4):747-789, July 1999.
    • (1999) ACM Transactions on Programming Languages and Systems , vol.21 , Issue.4 , pp. 747-789
    • Bultan, T.1    Gerber, R.2    Pugh, W.3
  • 18
    • 34250078835 scopus 로고
    • Subsumption and indexing in constraint query languages withlinear arithmetic constraints
    • D. Srivastava. Subsumption and indexing in constraint query languages withlinear arithmetic constraints. Annals of Math. and Artificial Intelligence, 8:315-343, 1993.
    • (1993) Annals of Math. and Artificial Intelligence , vol.8 , pp. 315-343
    • Srivastava, D.1


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