메뉴 건너뛰기




Volumn 3298, Issue , 2004, Pages 549-563

Query answering for OWL-DL with rules

Author keywords

[No Author keywords available]

Indexed keywords

BIRDS; DATA DESCRIPTION; ORTHOGONAL FUNCTIONS; SEMANTIC WEB;

EID: 35048890555     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30475-3_38     Document Type: Article
Times cited : (142)

References (22)
  • 1
    • 0003727420 scopus 로고    scopus 로고
    • F. Baader, D. Calvanese, D. McGuinness, D. Nardi, and P. Patel-Schneider, editors. Cambridge University Press, January
    • F. Baader, D. Calvanese, D. McGuinness, D. Nardi, and P. Patel-Schneider, editors. The Description Logic Handbook. Cambridge University Press, January 2003.
    • (2003) The Description Logic Handbook
  • 3
    • 0009858375 scopus 로고    scopus 로고
    • Resolution Theorem Proving
    • A. Robinson and A. Voronkov, editors, chapter 2, Elsevier Science
    • L. Bachmair and H. Ganzinger. Resolution Theorem Proving. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume I, chapter 2, pages 19-99. Elsevier Science, 2001.
    • (2001) Handbook of Automated Reasoning , vol.1 , pp. 19-99
    • Bachmair, L.1    Ganzinger, H.2
  • 13
    • 0007904166 scopus 로고    scopus 로고
    • Practical Reasoning for Very Expressive Description Logics
    • I. Horrocks, U. Sattler, and S. Tobies. Practical Reasoning for Very Expressive Description Logics. Logic Journal of the IGPL, 8(3):239-263, 2000.
    • (2000) Logic Journal of the IGPL , vol.8 , Issue.3 , pp. 239-263
    • Horrocks, I.1    Sattler, U.2    Tobies, S.3
  • 14
    • 26844461458 scopus 로고    scopus 로고
    • Reasoning for Description Logics around SHIQ in a Resolution Framework
    • FZI, Karlsruhe, Germany, April
    • U. Hustadt, B. Motik, and U. Sattler. Reasoning for Description Logics around SHIQ in a Resolution Framework. Technical Report 3-8-04/04, FZI, Karlsruhe, Germany, April 2004. http://www.fzi.de/wim/publikationen.php?id=1172.
    • (2004) Technical Report 3-8-04/04
    • Hustadt, U.1    Motik, B.2    Sattler, U.3
  • 16
    • 0032156942 scopus 로고    scopus 로고
    • Combining Horn rules and description logics in CARIN
    • A. Y. Levy and M.-C. Rousset. Combining Horn rules and description logics in CARIN. Artificial Intelligence, 104(1-2):165-209, 1998.
    • (1998) Artificial Intelligence , vol.104 , Issue.1-2 , pp. 165-209
    • Levy, A.Y.1    Rousset, M.-C.2
  • 17
    • 0348239296 scopus 로고    scopus 로고
    • Description Logics with Concrete Domains-A Survey
    • King's College Publications
    • C. Lutz. Description Logics with Concrete Domains-A Survey. In Advances in Modal Logics, volume 4. King's College Publications, 2003.
    • (2003) Advances in Modal Logics , vol.4
    • Lutz, C.1
  • 19
    • 15544368828 scopus 로고    scopus 로고
    • Computing Small Clause Normal Forms
    • A. Robinson and A. Voronkov, editors, chapter 6, Elsevier Science
    • A. Nonnengart and C. Weidenbach. Computing Small Clause Normal Forms. In A. Robinson and A. Voronkov, editors, 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
  • 22
    • 0001652558 scopus 로고    scopus 로고
    • Why is modal logic so robustly decidable?
    • N. Immerman and P. Kolaitis, editors, Descriptive Complexity and Finite Models, AMS
    • M. Vardi. Why is modal logic so robustly decidable? In N. Immerman and P. Kolaitis, editors, Descriptive Complexity and Finite Models, volume 31 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 149-184. AMS, 1997.
    • (1997) DIMACS Series in Discrete Mathematics and Theoretical Computer Science , vol.31 , pp. 149-184
    • Vardi, M.1


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