메뉴 건너뛰기




Volumn 3718 LNCS, Issue , 2005, Pages 40-51

RELVIEW - An OBDD-based computer algebra system for relations

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ALGEBRA; RELATIONAL ALGEBRA; RELATIONS (MATHEMATICS);

EID: 33744947550     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11555964_4     Document Type: Conference Paper
Times cited : (55)

References (13)
  • 1
    • 84957062460 scopus 로고    scopus 로고
    • RELVIEW - A system for calculation with relations and relational programming
    • Proc. 1. Conf. on Fundamental Approaches to Software Engineering, Springer
    • R. Behnke et al., RELVIEW - A system for calculation with relations and relational programming, in: Proc. 1. Conf. on Fundamental Approaches to Software Engineering, LNCS 1382, Springer (1998), 318-321.
    • (1998) LNCS , vol.1382 , pp. 318-321
    • Behnke, R.1
  • 2
    • 1142308547 scopus 로고    scopus 로고
    • Modelling sequences within the RELVIEW system
    • R. Berghammer, T. Hoffmann, Modelling sequences within the RELVIEW system, J. of Univ. Comp. Sci. 7 (2001), 107-123.
    • (2001) J. of Univ. Comp. Sci. , vol.7 , pp. 107-123
    • Berghammer, R.1    Hoffmann, T.2
  • 3
    • 84858899524 scopus 로고    scopus 로고
    • R. Berghammer, B. Möller, G. Struth (eds,), Proc. 7th Int, Workshop Relational Methods in Computer Science, Springer
    • R. Berghammer, B. Möller, G. Struth (eds,), Proc. 7th Int, Workshop Relational Methods in Computer Science, LNCS 3051, Springer (2004).
    • (2004) LNCS , vol.3051
  • 4
    • 0009005131 scopus 로고    scopus 로고
    • Relational methods in computer science
    • C. Brink, W. Kahl, G. Schmidt (eds.), Springer
    • C. Brink, W. Kahl, G. Schmidt (eds.), Relational methods in computer science, Advances in Computer Science, Springer (1997).
    • (1997) Advances in Computer Science
  • 5
    • 0026913667 scopus 로고
    • Symbolic Boolean manipulation with ordered binary decision diagrams
    • R.E. Bryant, Symbolic Boolean manipulation with ordered binary decision diagrams, ACM Com. Surv, 24 (1992), 293-318.
    • (1992) ACM Com. Surv , vol.24 , pp. 293-318
    • Bryant, R.E.1
  • 8
    • 84938061576 scopus 로고    scopus 로고
    • Simple and fast: Improving a branch-and-bound algorithm for maximum clique
    • Proc. 10. Europ. Symp. on Alg., Springer
    • T. Fable, Simple and fast: Improving a branch-and-bound algorithm for maximum clique, in: Proc. 10. Europ. Symp. on Alg., LNCS 2461, Springer (2002), 485-498.
    • (2002) LNCS , vol.2461 , pp. 485-498
    • Fable, T.1
  • 9
    • 16244391131 scopus 로고    scopus 로고
    • Using relational algebra for the analysis of Petri nets in a CASE tool based approach
    • IEEE Press
    • A. Fronk, Using relational algebra for the analysis of Petri nets in a CASE tool based approach, Proc. 2nd IEEE Int. Conf. on Software Engineering and Formal Methods, IEEE Press (2004), 396-405.
    • (2004) Proc. 2nd IEEE Int. Conf. on Software Engineering and Formal Methods , pp. 396-405
    • Fronk, A.1
  • 13
    • 0003197321 scopus 로고    scopus 로고
    • Branching programs and binary decision diagrams: Theory and applications
    • SIAM
    • I. Wegener, Branching programs and binary decision diagrams: Theory and applications, SIAM Monographs on Discr. Math, and Appl., SIAM (2000).
    • (2000) SIAM Monographs on Discr. Math, and Appl.
    • Wegener, I.1


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