A Perfect Match for Reasoning, Explanation, and Reason Maintenance

Kotowski, Jakub und Bry, François (2009): A Perfect Match for Reasoning, Explanation, and Reason Maintenance. Third International Conference, RR 2009, Chantilly, USA, 25. - 26. Oktober 2009. Polleres, Axel (Hrsg.): In: Web reasoning and rule systems : third international conference, RR 2009, Chantilly, VA, USA, October 25 - 26, 2009 ; proceedings, Bd. 5837 Berlin: Springer. S. 227-241

Abstract

Path query languages have been previously shown to com- plement RDF rule languages in a natural way and have been used as a means to implement the RDFS derivation rules. RPL is a novel path query language specifically designed to be incorporated with RDF rules and comes in three avors: Node-, edge- and path- avored expressions allow to express conditional regular expressions over the nodes, edges, or nodes and edges appearing on paths within RDF graphs. Providing reg- ular string expressions and negation, RPL is more expressive than other RDF path languages that have been proposed. We give a compositional semantics for RPL and show that it can be evaluated efficiently, while several possible extensions of it cannot.

• Dokumententyp: Konferenzbeitrag (Bericht)
• Fakultät: Mathematik, Informatik und Statistik > Informatik
• Themengebiete: 000 Informatik, Informationswissenschaft, allgemeine Werke > 004 Informatik
• Ort: Berlin
• Bemerkung: The final publication is available at link.springer.com. DOI:10.1007/978-3-642-05082-4_16
• Sprache: Englisch