Grad.Vortrag Markus Krötzsch/en
Tractable Rules for Description Logics
Type of Event:
Formal models of domain-specific knowledge abound in science and technology. It is desirable that such models can be managed, exchanged, and interpreted in computer systems, and the term "ontology" was coined to refer to the respective modelling artefacts. A prominent application field for ontologies is the Semantic Web where the Web Ontology Language OWL is the predominant modelling language. The formal semantics of OWL is largely based on the description logic (DL) family of knowledge representation formalisms that are well-suited for terminological modelling. Rule-based knowledge representation languages, in contrast, have a stronger focus on modelling relationships between instances. Both perspectives are relevant in applications but the combination of rules and DLs turns out to be difficult, since vital computational properties such as decidability are lost easily.
The subject of this talk is the development of hybrid DL rule languages based on first-order Horn rules. Reasoning for SWRL – the combination of DLs with (first-order) datalog – is known to be undecidable, and we identify a novel class of decidable SWRL fragments, called DL Rules, that can further be extended with DL-safe variables to obtain the class of DL+safe Rules. This leads to expressive DL rule languages with high computational complexities, motivating the study of more restricted languages. We introduce a new tractable DL rule language ELP which extends the known approaches of Description Logic Programs and EL++, although the union of these languages is intractable. ELP incorporates DL Rules and a certain form of DL+safe rules, and we present a reasoning procedure based on a direct reduction to datalog that preserves the structure of rules.
Overall, this work advances the understanding of the relationship of rules and description logics, leading to concrete new knowledge representation formalisms of practical relevance. DL+safe rules constitute one of the broadest classes of decidable SWRL fragments known today. ELP provides a tractable DL rule language that generalises the novel light-weight ontology languages OWL RL and OWL EL as standardised by W3C, and that has been adopted as the basis for the WSML-DL v2.0 dialect of the Web Service Modeling Language. Our results also suggest new rule-based implementation methods for supporting these languages based on a single inferencing algorithm.
Start: 2010-01-20 at 3:45 pm
End: 2010-01-20 at 4:45 pm
Building: 11.40, Room: 231
iCal event: (iCal)
Host: Research group Web Science