Probabilistic Abox Abduction in Description Logics

Presented at: The 7th International Workshop on Scalable Semantic Web Knowledge Base Systems (SSWS2011)

by Murat Sensoy, Achille Fokoue, Mudhakar Srivatsa, Jeff Z. Pan

In recent years, there has been an explosion of publicly availableSemantic Web data. In order to effectively integrate millions ofsmall, distributed data sources and quickly answer queries, we previouslyproposed a tree structure query optimization algorithm that takes thesource selectivity of each query subgoal as the heuristic to plan the queryexecution and uses the most selective subgoals to provide constraintsthat make other subgoals selective. However, this constraint propagationis incomplete when the relevant ontologies contain cyclic axioms. Here,we propose an improvement to this algorithm that is complete for cyclicaxioms, yet still able to scale to millions of data sources.


Resource URI on the dog food server: http://data.semanticweb.org/workshop/ssws/2011/paper/5


Explore this resource elsewhere: