Location visible to members
Where: seminar room SR049, Takusstr. 9, 14195 Berlin (http://www.mi.fu-berlin.de/fb/contact/location.html) (location (http://www.openstreetmap.org/relation/450685))
When: 14:00 - 15:30
The Many Uses of Rules in Ontology-Based Data Access
Speaker: Prof. Dr. Harold Boley, Faculty of Computer Science, University of New Brunswick, Canada
Ontology-Based Data Access (OBDA) enables automated reasoning over an ontology as a generalized global schema for the data in local (e.g., relational or graph) databases reachable through mappings. OBDA can semantically validate, enrich, and integrate heterogeneous data sources. Motivated by rule-ontology synergies, this talk discusses key concepts of OBDA and their foundation in three kinds of (logical) 'if-then' rules, using examples from the DeltaForest case study on the susceptibility of forests to climate change. (1) A query is a special Datalog rule whose conjunctive body can be rewritten (see 2) and unfolded (see 3), and whose n-ary head predicate instantiates the distinguished answer variables of the body predicates. OBDA ontologies beyond RDF Schema (RDFS) expressivity usually permit negative constraints for data validation, which are translated to Boolean conjunctive queries corresponding to integrity rules. (2) The OBDA ontology supports query rewriting and database materialization through global-schema-level reasoning. It usually includes the expressivity of RDFS, whose class and property subsumptions can be seen as single-premise Datalog rules with, respectively, unary and binary predicates, and whose remaining axioms are also definable by rules. OBDA ontologies often extend RDFS to the description logic DL-Lite (as in OWL 2 QL), including subsumption axioms that correspond to (head-)existential rules. Recent work has also explored Rule-Based Data Access, e.g. via Description Logic Programs (as in OWL 2 RL, definable in RIF-Core), Datalog+/-, and Disjunctive Datalog. (3) OBDA data integration is centered on Global-As-View (GAV) mappings, which are safe Datalog rules allowing query unfolding of each global head predicate into a conjunction of local body predicates. These (heterogeneous) conjunctive queries can be further mapped to the database languages of the sources (e.g., to SQL or SPARQL). Conversely, the same GAV mappings allow database folding. The talk develops a unified architecture for (1) to (3).
Dr. Harold Boley is adjunct professor at the Faculty of Computer Science, University of New Brunswick, Canada, and chair of RuleML Inc. His work on the specification of Web rules through RuleML (http://ruleml.org/) has found broad uptake. Deliberation RuleML 1.01 (http://wiki.ruleml.org/index.php/Specification_of_Deliberation_RuleML_1.01) is now being released, used for Datalog+/- (http://www.cs.nmsu.edu/ALP/2010/12/datalog-a-new-family-of-languages-for-ontology-querying/), and applied to Rule-Based Data Access (http://wiki.ruleml.org/index.php/Rule-Based_Data_Access). RuleML has been combined with OWL (http://www.w3.org/2001/sw/wiki/OWL) to SWRL (http://www.w3.org/Submission/SWRL/), has become the main input to the W3C Recommendation RIF (http://www.w3.org/2005/rules/wiki/RIF_Working_Group), and has provided the foundation for OASIS LegalRuleML (https://www.oasis-open.org/committees/tc_home.php?wg_abbrev=legalruleml). His Rule Responder (http://responder.ruleml.org/) projects have enabled deployed distributed applications for the Social Semantic Web. His recent innovations in data-plus-knowledge representation include the object-relational PSOA RuleML (http://wiki.ruleml.org/index.php/PSOA_RuleML) and the visualization framework Grailog (http://wiki.ruleml.org/index.php/Grailog).