Static type-checking of datalog with ontologies

5Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show how coupling of the emerging rule level of the Semantic Web to the existing ontology level can be achieved by static typing of web rules of a given application with classes of the ontology describing the application domain. This paper describes the principles and the implementation of a system that checks correctness of a given set of Datalog rules encoded in XML (according to the RuleML standard) wrt a type specification, where the Datalog predicates are typed with classes described by an OWL ontology. The type checker is based on a well-known verification technique for logic programs and employs the RACER reasoner for checking the verification conditions. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Henriksson, J., & Maluszyriski, J. (2004). Static type-checking of datalog with ontologies. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3208, 76–89. https://doi.org/10.1007/978-3-540-30122-6_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free