메뉴 건너뛰기




Volumn 2475, Issue , 2002, Pages 113-122

Towards a mereological system for direct products and relations

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EID: 84942908291     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45813-1_14     Document Type: Conference Paper
Times cited : (3)

References (22)
  • 4
    • 0014797273 scopus 로고
    • A relational model of data for large shared data banks
    • E. F. Codd, A relational model of data for large shared data banks, Comm. of the ACM, 13 (1970) 377-388.
    • (1970) Comm. Of the ACM , vol.13 , pp. 377-388
    • Codd, E.F.1
  • 5
    • 0035965495 scopus 로고    scopus 로고
    • Cylindric structures and dependencies in data bases
    • I. Düntsh, S. Mikulás, Cylindric structures and dependencies in data bases, Theoretical Computer Science, 269,1,2 (2001), 451-468.
    • (2001) Theoretical Computer Science , vol.269 , Issue.1-2 , pp. 451-468
    • Düntsh, I.1    Mikulás, S.2
  • 10
    • 84942889465 scopus 로고    scopus 로고
    • CRL Report 355, Mc- Master University, Hamilton, Ontario, Canada
    • R. Janicki, On Formal Semantics of Tabular Expressions, CRL Report 355, Mc- Master University, Hamilton, Ontario, Canada 1997. Available at http://www.crl.mcmaster.ca/SERG/serg.publications.html
    • (1997) On Formal Semantics of Tabular Expressions
    • Janicki, R.1
  • 11
    • 12344324863 scopus 로고    scopus 로고
    • Remarks on Mereology of Direct Products and Relations
    • J. Desharnais (ed.), to appear, early version at
    • R. Janicki, Remarks on Mereology of Direct Products and Relations, in J. Desharnais (ed.), Relational Methods in Computer Science, Methodos Publ. 2002, to appear, early version at http://www.crl.mcmaster.ca/SERG/serg.publications.html
    • (2002) Relational Methods in Computer Science, Methodos Publ
    • Janicki, R.1
  • 16
    • 84942883160 scopus 로고    scopus 로고
    • Requirements Scenarios Formalization Technique: N Versions Towards One Good Version
    • R. Khédri, Requirements Scenarios Formalization Technique: n Versions Towards One Good Version, Proc. of RELMICS’01, Genova 2001.
    • (2001) Proc. Of RELMICS’01, Genova
    • Khédri, R.1
  • 18
    • 0006490995 scopus 로고
    • CRL Report 260, McMaster University, Hamilton, Ontario, Canada
    • D. L. Parnas, Tabular representations of relations, CRL Report 260, McMaster University, Hamilton, Ontario, Canada 1992.
    • (1992) Tabular Representations of Relations
    • Parnas, D.L.1
  • 19
    • 0029387560 scopus 로고
    • Functional Documentation for Computer System Egineering
    • D. L. Parnas, J. Madey, Functional Documentation for Computer System Egineering, Science of Computer Programming, 24, 1 (1995), 41-61.
    • (1995) Science of Computer Programming , vol.24 , Issue.1 , pp. 41-61
    • Parnas, D.L.1    Madey, J.2
  • 20
    • 0035302088 scopus 로고    scopus 로고
    • On Connection Synthesis via Rough Mereology
    • L. Polkowski, On Connection Synthesis via Rough Mereology, Fundamenta Informaticae, 46 (2001) 83-96.
    • (2001) Fundamenta Informaticae , vol.46 , pp. 83-96
    • Polkowski, L.1
  • 21
    • 12344289431 scopus 로고    scopus 로고
    • Rough Mereology; A New Paradigm for Approximate Reasoning
    • L. Polkowski, A. Skowron, Rough Mereology; A New Paradigm for Approximate Reasoning, Journal of Approximate Reasoning, 15, 4 (1997), 316-333.
    • (1997) Journal of Approximate Reasoning , vol.15 , Issue.4 , pp. 316-333
    • Polkowski, L.1    Skowron, A.2


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