UMBC ebiquity

Constraint Generation and Reasoning in OWL

Authors: Tom Briggs

Date: November 17, 2008

Abstract: The majority of OWL ontologies in the emerging SemanticWeb are constructed from properties that lack domain and range constraints. Constraints in OWL are different from the familiar uses in programming languages and databases. They are actually type assertions that are made about the individualswhich are connected by the property. Because they are type assertions these assertions can add vital information to the individuals involved and give information on how the defining property may be used. Three different automated generation techniques are explored in this research: disjunction, least-common named subsumer, and vivification. Each algorithm is compared for the ability to generalize, and the performance impacts with respect to the reasoner. A large sample of ontologies from the Swoogle repository are used to compare real-world performance of these techniques. Using generated facts is a type of default reasoning. This may conflict with future assertions to the knowledge base. While general default reasoning is non-monotonic and undecidable a novel approach is introduced to support efficient contraction of the default knowledge. Constraint generation and default reasoning, together, enable a robust and efficient generation of domain and range constraints which will result in the inference of additional facts and improved performance for a number of Semantic Web applications.

Type: PhdThesis

Organization: Department of Computer Science and Electrical Engineering

School: University of Maryland, Baltimore County

Google Scholar: search

Number of downloads: 2287

 

Available for download as


size: 605907 bytes

size: 2363000 bytes

Bookmark at: Digg | Del.icio.us | Connotea | CiteULike