메뉴 건너뛰기




Volumn 4733 LNAI, Issue , 2007, Pages 36-47

Finite model reasoning on UML class diagrams via constraint programming

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER SOFTWARE; CONSTRAINT THEORY; FINITE AUTOMATA;

EID: 38049129334     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74782-6_5     Document Type: Conference Paper
Times cited : (30)

References (11)
  • 1
    • 0003727420 scopus 로고    scopus 로고
    • Baader, F, Calvanese, D, McGuinness, D, Nardi, D, Patel-Schneider, P.F, eds, Cambridge University Press, Cambridge
    • Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, Cambridge (2003)
    • (2003) The Description Logic Handbook: Theory, Implementation and Applications
  • 4
    • 0002281056 scopus 로고    scopus 로고
    • Finite model reasoning in description logics
    • Calvanese, D.: Finite model reasoning in description logics. In: Proc. of KR'96, pp. 292-303 (1996)
    • (1996) Proc. of KR'96 , pp. 292-303
    • Calvanese, D.1
  • 5
    • 38049101214 scopus 로고    scopus 로고
    • Calvanese, D.: Unrestricted and Finite Model Reasoning in Class-Based Representation Formalisms. PhD thesis, Dip. di Inf. e Sist., Univ. di Roma La Sapienza (1996)
    • Calvanese, D.: Unrestricted and Finite Model Reasoning in Class-Based Representation Formalisms. PhD thesis, Dip. di Inf. e Sist., Univ. di Roma "La Sapienza" (1996)
  • 7
    • 38049162335 scopus 로고    scopus 로고
    • ILOG OPL Studio system version 3.6.1 user's manual (2002)
    • ILOG OPL Studio system version 3.6.1 user's manual (2002)
  • 9
    • 0025632431 scopus 로고
    • On the satisfiability of dependency constraints in entityrelationship schemata
    • Lenzerini, M., Nobili, P.: On the satisfiability of dependency constraints in entityrelationship schemata. Information Systems 15(4), 453-461 (1990)
    • (1990) Information Systems , vol.15 , Issue.4 , pp. 453-461
    • Lenzerini, M.1    Nobili, P.2
  • 10
    • 7044227454 scopus 로고    scopus 로고
    • The complexity of finite model reasoning in description logics
    • Baader, F, ed, Automated Deduction, CADE-19, Springer, Heidelberg
    • Lutz, C., Sattler, U., Tendera, L.: The complexity of finite model reasoning in description logics. In: Baader, F. (ed.) Automated Deduction - CADE-19. LNCS (LNAI), vol. 2741, pp. 60-74. Springer, Heidelberg (2003)
    • (2003) LNCS (LNAI , vol.2741 , pp. 60-74
    • Lutz, C.1    Sattler, U.2    Tendera, L.3


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