Verifying OWL and ORL ontologies in PVS

Authors:
Jin Song Dong;Yuzhang Feng;Yuan Fang Li
Affiliations:
School of Computing, National University of Singapore;School of Computing, National University of Singapore;School of Computing, National University of Singapore
Venue:
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Year:
2004

Citing 8
Cited 1

Alcoa: the alloy constraint analyzer

Proceedings of the 22nd international conference on Software engineering
The FaCT System

TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
The Z/EVES System

ZUM '97 Proceedings of the 10th International Conference of Z Users on The Z Formal Specification Notation
OilEd: A Reason-able Ontology Editor for the Semantic Web

KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
PVS: A Prototype Verification System

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
An introduction to description logics

The description logic handbook
A combined approach to checking web ontologies

Proceedings of the 13th international conference on World Wide Web
A proposal for an owl rules language

Proceedings of the 13th international conference on World Wide Web

Preliminary explorations in specifying and validating entity-relationship models in PVS

Proceedings of the second workshop on Automated formal methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Semantic Web vision is being realized to reach the full potential of the Web. Semantic data modeling is the foundation of the Semantic Web. The Web Ontology Language (OWL) and OWL Rules Language (ORL) provides basic machinery to the semantic mark-up for data. However, there is limited tool support for OWL and no tool support currently for ORL. In this paper, we propose to model OWL and ORL language semantics in PVS specification language so that OWL and ORL ontologies can be transformed and verified in the Prototype Verification System (PVS). PVS user-defined proof strategies are also developed to automate the proof process.