1 / 10

OWL 1.1 Rules

OWL 1.1 Rules. Markus Krötzsch Sebastian Rudolph Pascal Hitzler AIFB, University of Karlsruhe, Germany logic.aifb.uni-karlsruhe.de Deduktionstreffen, Saarbrücken, March 2008. Slide 1. Neuerscheinung.

connie
Download Presentation

OWL 1.1 Rules

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. OWL 1.1 Rules Markus Krötzsch Sebastian Rudolph Pascal Hitzler AIFB, University of Karlsruhe, Germany logic.aifb.uni-karlsruhe.de Deduktionstreffen, Saarbrücken, March 2008 Slide 1 Slide 1

  2. Neuerscheinung • Hitzler, Krötzsch, Rudolph, SureSemantic Web – Grundlagen.Springer, 2008.24,95 € • Erstes deutsches Lehrbuch zu Grundlagen des Semantic Web. • Behandelt u.a. Syntax, Semantik und Deduktionsverfahren von OWL (SHOIN(D)). Slide 2

  3. Web Ontology Language OWL • Semantic Web Knowledge Representation Language • W3C recommendation April 2004. • OWL DL: Fragment of 1st order predicate logic. • OWL DL: • Description LogicSHOIN(D). • decidable. • NExpTime Slide 3

  4. OWL1.1 • Description Logic SROIQ • in standardisation process (W3C) • decidable, NExpTime-hard • extends SHOINwith • role inclusion axioms R ± S v T • qualified number restrictions • punning • further role properties • identified tractable fragmentsEL++, DL-Lite, DLP, Horn-SHIQ, ... Slide 4

  5. V V DL Rules • Rules over some description logic L • B, H sets of concept or role atoms in L, x the variables in B and H • Rules of the form (8x) B ! H with • for any non-initial individual u in B, there is a path from exactly one initial t to u in B • for any t,u there is at most one path in B from t to u • if H contains an atom C(t) or R(t,u), then t is initial in B Slide 5

  6. SROIQ Rules • can be internalised into SROIQ • internalisation is polynomial • however, it is not an obvious transformation • decidable fragment of SWRL within SROIQ Slide 6

  7. EL++ Rules • substantially extends EL++ • EL++ together with EL++ Rules are tractable (in P) • EL++ can be reduced to EL++ Rules • reduction is polynomial • This allows to apply rule-based reasoning techniques for reasoning with EL++ and EL++ Rules! Slide 7

  8. DLP1.1 = DLP + DLP Rules • Reducible to function-free first-order Horn rules with at most five variables per formula. • Reduction can be done in polynomial time. • DLP1.1 is tractable (in P) Slide 8

  9. Conclusions • OWL1.1 Rules as expressive rules fragment of OWL1.1. • Automatically supported by OWL1.1 reasoners. • EL++ Rules as new tractable fragment – includes EL++. • DLP1.1: new tractable rules fragment extending DLP. Slide 9

  10. More Details at the Poster! THANKS! Slide 10

More Related