On the properties of metamodeling in OWL

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3729 LNCS, Issue , 2005, Pages 548-562

  Motik, Boris ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; INFORMATION RETRIEVAL; MATHEMATICAL MODELS; SEMANTICS;

DESCRIPTION LOGIC; METALOGICAL SYMBOLS; METAMODELING; SEMANTIC WEB ONTOLOGY;

METADATA;

EID: 33646405432     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11574620_40     Document Type: Conference Paper

References (17)

1. F. Baader, D. Calvanese, D. McGuinness, D. Nardi, and P. Patel-Schneider, editors. The Description Logic Handbook. Cambridge University Press, January 2003.
2. L. Bachmair, H. Ganzinger, C. Lynch, and W. Snyder. Basic Paramodulation. Information and Computation, 121(2):172-192, 1995.
3. R. Berger. The undecidability of the dominoe problem. Memoirs of the American Mathematical Society, 66, 1966.
4. W. Chen, M. Kifer, and D. S. Warren. HILOG: a foundation for higher-order logic programming. Journal of Logic Programming, 15(3):187-230, 1993.
5. I. Horrocks and P. F. Patel-Schneider. Three Theses of Representation in the Semantic Web. In Proc. WWW 2003, pages 39-47. ACM, 2003.
6. I. Horrocks and P. F. Patel-Schneider. A Proposal for an OWL Rules Language. In Proc. WWW 2004. ACM, 2004.
7. I. Horrocks, U. Sattler, and S. Tobies. Practical Reasoning for Very Expressive Description Logics. Logic Journal of the IGPL, 8(3):239-263, 2000.
8. I. Horrocks, U. Sattler, and S. Tobies. Reasoning with Individuals for the Description Logic SHIQ. In Proc. CADE 2000, number 1831 in LNAI, pages 482-496. Springer, 2000.
9. 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/ipe/publikationen.php?id=1172.
10. - Description Logic to Disjunctive Datalog Programs. In Proc. KR 2004, pages 152-162, Menlo Park, California, USA, June 2004. AAAI Press.
11. 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.
12. L. Pacholski, W. Szwast, and L. Tendera. Complexity Results for First-Order Two-Variable Logic with Counting. SIAM Journal on Computing, 29(4):1083-1117, 2000.
13. J. Pan and I. Horrocks. RDFS(FA) and RDF MT: Two Semantics for RDFS. In Proc. ISWC 2003, number 2870 in LNCS, pages 30-46. Springer, 2003.
14. P. F. Patel-Schneider, P. Hayes, and I. Horrocks. OWL Web Ontology Language; Semantics and Abstract Syntax. http://www.w3.org/TR/owl-semantics/, 2002.
15. G. Schreiber. The Web is not well-formed. IEEE Intelligent Systems, 17(2):79-80, March/April 2002.
16. Contribution to the section "Trends & Controversies: Ontologies KISSES in Standardization", edited by S. Staab.
17. C. Welty and D. Ferrucci. What's in an instance? Technical Report 94-18, Max-Planck-Institut, 1994. RPI Computer Science.