Constraint Generation and Reasoning in OWL
by Tom Briggs
Monday, November 17, 2008, 12:00pm - Monday, November 17, 2008, 14:00pm
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.
Finally, using generated facts, a type of default reasoning, 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 retraction of the default knowledge. Combined, these techniques enable a robust and efficient generation of domain and range constraints which will result in inference of additional facts and improved performance for a number of Semantic Web applications. Ph.D. Dissertation Defense