메뉴 건너뛰기




Volumn 258, Issue , 2007, Pages

Adding integrity constraints to OWL

Author keywords

[No Author keywords available]

Indexed keywords

INTEGRITY CONSTRAINTS; RELATIONAL DATABASE;

EID: 84884632313     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (24)

References (11)
  • 2
    • 79959719638 scopus 로고    scopus 로고
    • Description logics with circumscription
    • Lake District, UK
    • P. Bonatti, C. Lutz, and F. Wolter. Description Logics with Circumscription. In Proc. KR 2006, pages 400-410, Lake District, UK, 2006.
    • (2006) Proc. KR 2006 , pp. 400-410
    • Bonatti, P.1    Lutz, C.2    Wolter, F.3
  • 3
    • 0030125127 scopus 로고    scopus 로고
    • On the relative expressiveness of description logics and predicate logics
    • A. Borgida. On the Relative Expressiveness of Description Logics and Predicate Logics. Artificial Intelligence, 82(1-2):353-367, 1996.
    • (1996) Artificial Intelligence , vol.82 , Issue.1-2 , pp. 353-367
    • Borgida, A.1
  • 4
  • 6
    • 0028524383 scopus 로고
    • Minimal belief and negation as failure
    • V. Lifschitz. Minimal Belief and Negation as Failure. Artificial Intelligence, 70(1-2):53-72, 1994.
    • (1994) Artificial Intelligence , vol.70 , Issue.1-2 , pp. 53-72
    • Lifschitz, V.1
  • 7
    • 35348840321 scopus 로고    scopus 로고
    • Bridging the gap between OWL and relational databases
    • Banff, Alberta, Canada. ACM Press. To appear
    • B. Motik, I. Horrocks, and U. Sattler. Bridging the Gap Between OWL and Relational Databases. In Proc. WWW 2007, Banff, Alberta, Canada. ACM Press. To appear.
    • Proc. WWW 2007
    • Motik, B.1    Horrocks, I.2    Sattler, U.3
  • 9
    • 84880854013 scopus 로고    scopus 로고
    • A faithful integration of description logics with logic programming
    • Hyderabad, India
    • B. Motik and R. Rosati. A Faithful Integration of Description Logics with Logic Programming. In Proc. IJCAI 2007, Hyderabad, India, 2007.
    • (2007) Proc. IJCAI 2007
    • Motik, B.1    Rosati, R.2
  • 10
    • 15544368828 scopus 로고    scopus 로고
    • Computing small clause normal forms
    • chapter 6 Elsevier Science
    • A. Nonnengart and C. Weidenbach. Computing Small Clause Normal Forms. In Handbook of Automated Reasoning, volume I, chapter 6, pages 335-367. Elsevier Science, 2001.
    • (2001) Handbook of Automated Reasoning , vol.1 , pp. 335-367
    • Nonnengart, A.1    Weidenbach, C.2
  • 11
    • 44049112934 scopus 로고
    • What should a database know?
    • R. Reiter. What Should a Database Know? Journal of Logic Programming, 14(1-2):127-153, 1992.
    • (1992) Journal of Logic Programming , vol.14 , Issue.1-2 , pp. 127-153
    • Reiter, R.1


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